{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"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":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Context::textarea_handle_input (cyclomatic 126): Context::textarea_handle_input has cyclomatic complexity 126 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc826e338e7a16c0da18be2359712a106d31a0fc8abf61d59ba265578253c735"}},{"ruleId":"D1","level":"warning","message":{"text":"unicode_gen::extract_values_from_ucd (cyclomatic 53): unicode_gen::extract_values_from_ucd has cyclomatic complexity 53 (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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"d689e487087cf322c6cc5e4233f8296b2726a0663974f287ee447f7342b8aca9"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::bin::edit::draw_filepicker::draw_file_picker (cyclomatic 50): edit::bin::edit::draw_filepicker::draw_file_picker has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_filepicker.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ab9ca4ce437258d21dc15dfdebcf3ce8c4d36f9dc6841d6da71ad45f7e5bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"Stream::next (cyclomatic 42): Stream::next has cyclomatic complexity 42 (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":"crates/edit/src/vt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e739b6a29a01bd2dfe3cabec8c1c7f314e6cbb4ba3258cd01b66508f81e2422b"}},{"ruleId":"D1","level":"warning","message":{"text":"MeasurementConfig::measure_forward (cyclomatic 40): MeasurementConfig::measure_forward has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/unicode/measurement.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3141aa3191ef8a26ae0c1d6a305493cdae7bfaa69ae0c5630c1c8822329019"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBuffer::render (cyclomatic 38): TextBuffer::render 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abb2a715f2ee911a8b5c8d2f54a38d07cb1a94b52e5efde0c362f429514f1a9"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBuffer::render_apply_highlights (cyclomatic 38): TextBuffer::render_apply_highlights has cyclomatic complexity 38 (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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"925d650807ab0167ff453f22eb1fc4d3104202860d63c5e22d7890cdc4b3ada3"}},{"ruleId":"D1","level":"warning","message":{"text":"lsh::run_render (cyclomatic 34): lsh::run_render 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":"crates/lsh/src/main.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"50109a4a2500727eaf6cd03cf3dc950188e2c83961ad6a8517f1d8fe5e4a719d"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::sys::unix::read_stdin (cyclomatic 33): edit::sys::unix::read_stdin has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/sys/unix.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627ee9062595d6b6a9f1ff95fd18d83b18da89cd79046997a739991767fc512"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::float::parse_f64_approx (cyclomatic 32): edit::float::parse_f64_approx has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/float.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8dfd072d7e88b152dd0f5a21b834517d43b4059cbd301398bd6f2ed9003782"}},{"ruleId":"D1","level":"warning","message":{"text":"Tui::create_context (cyclomatic 31): Tui::create_context has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a663e1f84c7967560fba7946b30c6ae95dde5274faa21ebf1786b1c10a03705"}},{"ruleId":"D1","level":"warning","message":{"text":"Stream::next (cyclomatic 30): Stream::next has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/input.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c5b9fe0e0dd0533c8c945d97adef12cd8c5adc20f4e26a9d1dcbac821f369a"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::generate_code (cyclomatic 30): Backend::generate_code 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":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bf9ad6140f42bde3c6bb3459dec8ce62bd3f7a3134dc0fdc26b9c6e5ee91c0"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::build::i18n::generate (cyclomatic 29): edit::build::i18n::generate has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"crates/edit/build/i18n.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe9554d5b6bc4395c3e6ff680ae70bf6529a9e270b43461c938155903226372"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::fuzzy::score_fuzzy (cyclomatic 28): edit::fuzzy::score_fuzzy has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/fuzzy.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdcb31fb5c107da8e271c86e9da4444c8c2605d9a814d859903bd57fcd1b8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBuffer::write (cyclomatic 27): TextBuffer::write has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d4867eb7a0f1e6702b4c4d97390a539c1fdecca9d3a267557cf60221091754"}},{"ruleId":"D1","level":"warning","message":{"text":"Framebuffer::render (cyclomatic 26): Framebuffer::render 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":"crates/edit/src/framebuffer.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c801b749a6479bd4eb3de1b9a5807ec9ea6443daf20d91503791fb97e2d2c00"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::bin::edit::main::draw (cyclomatic 26): edit::bin::edit::main::draw has cyclomatic complexity 26 (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":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d2dbb91c12ffe836670e3008d547c280e1006cac95e50cd62ec730cc415c96"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::bin::edit::main::setup_terminal (cyclomatic 23): edit::bin::edit::main::setup_terminal 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":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb37aaa04bcbebba06381842bd7a0d78651806262caa56c1f21e02230ff8445"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::sys::windows::read_stdin (cyclomatic 23): edit::sys::windows::read_stdin 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":"crates/edit/src/sys/windows.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7393f95e73d8f290f3f912badd2a2fb970a2b75dd431459251800921b760729"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBuffer::read_file (cyclomatic 22): TextBuffer::read_file 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b1664b38ca04705f42a86276a5b449d8d178ebf492fc328d9b636d7d0b7c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::bin::edit::draw_editor::draw_search (cyclomatic 22): edit::bin::edit::draw_editor::draw_search has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_editor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dce07880b87b4a44fd04a29f8ecaaa21eaac09c04d2fba1ff867ea06a0b15c"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::bin::edit::draw_statusbar::draw_statusbar (cyclomatic 22): edit::bin::edit::draw_statusbar::draw_statusbar 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":"crates/edit/src/bin/edit/draw_statusbar.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b45d6e84f5e6c86de46d0e493b4a1ac9bedbe86eb4a5444dc3ea5cf989016d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::list_end (cyclomatic 21): Context::list_end has cyclomatic complexity 21 (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":"crates/edit/src/tui.rs"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecda072c2fcbf1ecc7461167762dec10ad1b4a6d95d907166621e92dacff296"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBuffer::find_parse_replacement (cyclomatic 20): TextBuffer::find_parse_replacement 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa0fe75f59a0b99503efd5858c789d25031e846636ba6c7c1c5683a086a076a"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::scrollarea_end (cyclomatic 20): Context::scrollarea_end 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":"crates/edit/src/tui.rs"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"39273a59982c159a5e8b24254c891f668edc9ea2a0f9808a4259ab9246d36abc"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::icu::utext_access_impl (cyclomatic 19): edit::icu::utext_access_impl 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":"crates/edit/src/icu.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e107d684871cd5ed10fd8fcc562871adf1092a82808e7aea8fb0a73dad8c557"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexParser::parse_char_class (cyclomatic 19): RegexParser::parse_char_class 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":"crates/lsh/src/compiler/regex.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d3ba7e32b932c6885e59ef244dba658133319852d634354edc48f16207d05a"}},{"ruleId":"D1","level":"warning","message":{"text":"Tui::render_node (cyclomatic 18): Tui::render_node 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":"crates/edit/src/tui.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e1028aebc1709a3cea4d9ce3ac99ede1afd8572a3e24716a198b7c381bb8c"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::bin::edit::main::handle_args (cyclomatic 18): edit::bin::edit::main::handle_args 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":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3184df2c8c8455a1663eda46e4af3d07f9740c29b2f933f30315f5c96feb9"}},{"ruleId":"D1","level":"warning","message":{"text":"edit::unicode::sanitize::sanitize_control_chars_impl (cyclomatic 17): edit::unicode::sanitize::sanitize_control_chars_impl 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/unicode/sanitize.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f85f992ee7b79a578f0f5a25cfce1223cf17dff748da99e4bc2d312f088623"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::generate_assembly (cyclomatic 17): Generator::generate_assembly 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":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b0c07212d517f4f5fcf1c88782aec417ef2a7a03ee78f9d7fc580b6ff1a4e7"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBuffer::goto_line_start (cyclomatic 16): TextBuffer::goto_line_start 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"380b7d48d9953e6345a21ba3ec5b58f15f33d86f88cfe0f46718b7bda588d87e"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::generate_rust (cyclomatic 16): Generator::generate_rust has cyclomatic complexity 16 (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":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"557d877ed2c04efa249bd4ae97865ffac95cc19b300985791309770ee7dcff45"}},{"ruleId":"D1","level":"warning","message":{"text":"RegexParser::parse_atom (cyclomatic 16): RegexParser::parse_atom has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/regex.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8e22d6dc418aa120fb5372838ec1bb4b813ffc631e5b48f03319e6c1f229a0"}},{"ruleId":"D1","level":"warning","message":{"text":"unicode_gen::generate_rust (cyclomatic 16): unicode_gen::generate_rust 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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c05b6e6fbdab11828f4cc0f2c9356c66689ec70dfea8b9955e77235283e867c"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::textarea_handle_input (cognitive 253): Context::textarea_handle_input has cognitive complexity 253 (threshold 15). Drivers by points: if/else 82 (206 pts), match/switch 17 (39 pts), boolean chains 8 (nesting depth added 146). 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":"crates/edit/src/tui.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1722e854c71848981cb8c65c2de58011f90b75bfa26907ce79f0cd5c253b36"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream::next (cognitive 100): Stream::next has cognitive complexity 100 (threshold 15). Drivers by points: if/else 12 (40 pts), match/switch 9 (30 pts), loops 7 (25 pts), boolean chains 5 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/vt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ce4b6090d5d11d0ef5e2d873fbae9585a623236bd0cdc808d2632b7935f2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"MeasurementConfig::measure_forward (cognitive 95): MeasurementConfig::measure_forward has cognitive complexity 95 (threshold 15). Drivers by points: if/else 28 (75 pts), loops 4 (10 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/unicode/measurement.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c9e252711e44ac5de067b3ad7eb98d9e7d865a0f6d7118468317dd18709956"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::render (cognitive 93): TextBuffer::render has cognitive complexity 93 (threshold 15). Drivers by points: if/else 28 (71 pts), loops 4 (13 pts), boolean chains 8, match/switch 1 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b081a2f3e65d2b943867dc607aaa3414a58997cd6028c10f2c66453a85bc861"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_filepicker::draw_file_picker (cognitive 73): edit::bin::edit::draw_filepicker::draw_file_picker has cognitive complexity 73 (threshold 15). Drivers by points: if/else 31 (49 pts), boolean chains 14, loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_filepicker.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ce213039e954cb7005bb4cabe14f2de8950b790bdfcfb938c25cb83205278"}},{"ruleId":"D2","level":"warning","message":{"text":"Framebuffer::render (cognitive 72): Framebuffer::render has cognitive complexity 72 (threshold 15). Drivers by points: if/else 24 (62 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3823ac75ac63b19970fce76339cbae39576f5f1a771544f2108f019d50d3ff"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::sys::unix::read_stdin (cognitive 72): edit::sys::unix::read_stdin has cognitive complexity 72 (threshold 15). Drivers by points: if/else 24 (52 pts), loops 4 (10 pts), match/switch 2 (8 pts), boolean chains 2 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/sys/unix.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0b93d406f9521b259e3002307cf0a75301d14db8820e58fb0fb99fd93ba693"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::fuzzy::score_fuzzy (cognitive 62): edit::fuzzy::score_fuzzy has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 10, loops 3 (5 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":"crates/edit/src/fuzzy.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6213a5f4a4545de3bcd84c0450e3e1dda0a7107268d55f6b32b80a330f6b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::main::setup_terminal (cognitive 59): edit::bin::edit::main::setup_terminal has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (35 pts), match/switch 4 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b29f92ac6e41238af7bd4ba61892af08250c176d2f3471b50ceefd48dd4cb"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_statusbar::draw_statusbar (cognitive 55): edit::bin::edit::draw_statusbar::draw_statusbar has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (50 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 31). 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":"crates/edit/src/bin/edit/draw_statusbar.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab9265a6ead41497c1d4af912ff6a1e1240424b36123fe103182b0f5d0fb572"}},{"ruleId":"D2","level":"warning","message":{"text":"Tui::create_context (cognitive 49): Tui::create_context has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 6, loops 1 (2 pts), match/switch 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":"crates/edit/src/tui.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c427eb63210ac9aeaeac16ea732117e80a57782c41b0dafae07b2c1236ac70c6"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::write (cognitive 48): TextBuffer::write has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 5 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4abffe393af128004944d6e47a921e27324e033e820108886330dc85f6b375"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::generate_code (cognitive 43): Backend::generate_code has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 4 (16 pts), loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ad222b58b064a9e82efca411402036a4b4eb17b518cfa6b22a3941b3f65d64"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::read_file (cognitive 42): TextBuffer::read_file has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06bd9131d2bae7115396abe96764db8f6b0bc998ef113a1ca561ee044a929f"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::float::parse_f64_approx (cognitive 42): edit::float::parse_f64_approx has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 8, loops 3 (5 pts), match/switch 3 (5 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":"crates/edit/src/float.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"665b9c4d724da5a92bcc2669262381c9087a473a1055a2549f2fca214182d088"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream::next (cognitive 41): Stream::next has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 6 (18 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/input.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e464eb4a243f13d49305d2c4977476d4532bb261a5c4b9a85a2a76be326aeeaa"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode_gen::extract_values_from_ucd (cognitive 41): unicode_gen::extract_values_from_ucd has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 5 (17 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eebb3edef4ae20a6b67cbd25a2698bb3a990c31183a1fb4004b75199fc79e25"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::buffer::navigation::word_select (cognitive 40): edit::buffer::navigation::word_select has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 2 (6 pts) (nesting depth added 27). 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":"crates/edit/src/buffer/navigation.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe204b6f7edd422cb7ba711e7b7d03761319c17c73622a7426b5c1edcfa84d4"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::icu::utext_access_impl (cognitive 38): edit::icu::utext_access_impl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/icu.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9898020fa4a869f14e0c7f45d0f49eac97996b699d7bc1aa7ab44ffdc3edc"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::sys::windows::read_stdin (cognitive 38): edit::sys::windows::read_stdin has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 2 (6 pts), boolean chains 5, 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":"crates/edit/src/sys/windows.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9bcfaa961bf5ea81abc2623be03f551c75a090ab4678a781753c88792b5494"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::find_parse_replacement (cognitive 37): TextBuffer::find_parse_replacement has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (8 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2341b7b399c0b823e76bac3d426d3cc8c0493f87c2db32bf0caddca5ee16e7"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::render_apply_highlights (cognitive 37): TextBuffer::render_apply_highlights has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf33ef5652b8a7153b47289a128b0f5b204937a3044206e5a56baccd1df4d76"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::build::i18n::generate (cognitive 37): edit::build::i18n::generate has cognitive complexity 37 (threshold 15). Drivers by points: loops 13 (16 pts), if/else 7 (11 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 11). Of this number, 34 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/build/i18n.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"de944bdcf86a03af0c565250e46fa1a096107bf9e7cbe03e853ac75c82b76c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::list_end (cognitive 34): Context::list_end has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 6 (9 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2875f53691716240ea4bbb97d086324c9cea4d43f4e2d253543dc0147d89c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::skip_whitespace_and_comments (cognitive 33): Parser::skip_whitespace_and_comments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (13 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/json.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871f04e57e18c12242b3684c2313e17f6311346b4ce09aa00ad77d18e35b60b"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::main::handle_args (cognitive 33): edit::bin::edit::main::handle_args has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 5, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"673b9e2adf446aa2e85e96a9cd4757f11fee972ccff497333593f4ceabb22115"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::generate_assembly (cognitive 33): Generator::generate_assembly has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94575a695f0c12a812bb70cb52ffb42795274dc5cd0731c0ec06ad15ea861d7"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::unicode::sanitize::sanitize_control_chars_impl (cognitive 32): edit::unicode::sanitize::sanitize_control_chars_impl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/unicode/sanitize.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fad53705a09c015f54b2cf7b84f1d3949ec9a74e92eec00cc61ae5b62bd897"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::scrollarea_end (cognitive 31): Context::scrollarea_end has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 16). 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":"crates/edit/src/tui.rs"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bd74c79cfe7bd152754b1a841bd08a800f556b60bfb5b22daaa1d50b035d42"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexParser::parse_char_class (cognitive 28): RegexParser::parse_char_class has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/regex.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3095e98fe28c113de969aa9a614f7bb3926d30169270c7183606106b516b994"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::goto_line_start (cognitive 27): TextBuffer::goto_line_start has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a64770945ac8cdbd44b00bafb84fe3d088c26f1a29461e41d0bc8ce48370c8"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::main::draw (cognitive 27): edit::bin::edit::main::draw has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 2 (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":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccc35559bf13b04bf2af6a32080dcff5acd28cbcbb8eb328bbc480a71686db9"}},{"ruleId":"D2","level":"warning","message":{"text":"lsh::glob::slow_path (cognitive 27): lsh::glob::slow_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 6, match/switch 1 (3 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":"crates/lsh/src/glob.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a56550bbd8e9f7a3a7a8be0110d42b7e7f51b284d1ae18f050cc012f3ff85e7"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_editor::draw_search (cognitive 26): edit::bin::edit::draw_editor::draw_search has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_editor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"861d6857b7f7e8501c312acdb3dd858ead0105d1f1b6f2aea4a0bbeba60ca411"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::cursor_move_delta_internal (cognitive 25): TextBuffer::cursor_move_delta_internal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 2 (4 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec715c9703f6a5146f799b101ae44ed3b203b5292093d66ecd65bb221956efe"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::generate_rust (cognitive 25): Generator::generate_rust has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (13 pts), if/else 6 (12 pts) (nesting depth added 9). 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":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e020d6000fa6968853f49bc05433848e454cd5285c6f062c4884971ee78373c1"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::write_file (cognitive 24): TextBuffer::write_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4aa92fab2e26d324b1df33b946e4f7e79823191c1a7dfe7f5059070eba327"}},{"ruleId":"D2","level":"warning","message":{"text":"lsh::compiler::optimizer::optimize_redundant_offset_backup_restore (cognitive 24): lsh::compiler::optimizer::optimize_redundant_offset_backup_restore has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/optimizer.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f3314eb60a27d507a74fb2ad0ba015f77a6c6a7216eecb7f34a11c323c570"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode_gen::generate_rust (cognitive 24): unicode_gen::generate_rust has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 6 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a7087e6c4aa595a4608fb2bcbc3b82600115d0d3aa8614102694c12ccdf2e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::textarea_internal (cognitive 23): Context::textarea_internal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7588859dfad8fa27a95ae488982991493df1f9e99cf3aac5996fbe8c5181b820"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_filepicker::draw_dialog_saveas_refresh_files (cognitive 23): edit::bin::edit::draw_filepicker::draw_dialog_saveas_refresh_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_filepicker.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba1445f0c778ee8245bd3e585b11d47158307eaf203cbc679ad15405bcb8c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::sys::unix::write_stdout (cognitive 23): edit::sys::unix::write_stdout has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (4 pts), match/switch 1 (2 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":"crates/edit/src/sys/unix.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adb3a4b1c15c8dce4d0342db7846de385cbc5cb9c8b7f178569a75e6bb96ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"lsh::run_render (cognitive 23): lsh::run_render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (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":"crates/lsh/src/main.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30501726e865fa9f215048cb0d84778a7543eb788b92a4f9e9fb31648b62af6"}},{"ruleId":"D2","level":"warning","message":{"text":"Tui::render_node (cognitive 22): Tui::render_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (6 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":"crates/edit/src/tui.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef542b4b153eaa621370a2ae963e70b00935e28109357bff9d9f9cb3392a68"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode_gen::generate_c (cognitive 22): unicode_gen::generate_c has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c1254e4d6fc20d75944c90ae49ad91badc0e18ebd687a92fc01b18ae79953"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Chars::next_slow (cognitive 21): Utf8Chars::next_slow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 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":"crates/edit/src/unicode/utf8.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"624712eaeb3556b6ac452d16fba07cf4f36aeacbda9cbdb6a8dc72b685e058ec"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::icu::get_available_encodings (cognitive 21): edit::icu::get_available_encodings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 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":"crates/edit/src/icu.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3904c17d01d333ee8d6a0d0312e4b92a9002427fc77cabc45d2d65f7dba3529a"}},{"ruleId":"D2","level":"warning","message":{"text":"LivenessAnalysis::compute_liveness (cognitive 21): LivenessAnalysis::compute_liveness has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (10 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"9261fb89a1d7e33bccb42bfa791f2352f71deb6a457f92166c48d429e771074b"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Main (cognitive 20): Program.Main has cognitive complexity 20 (threshold 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":"assets/highlighting-tests/csharp.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956e6f4e107f286b1a4fe46b5d294d555baef19539ca56db6154a2db843ed01"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::table_move_focus (cognitive 20): Context::table_move_focus has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a87f4b186e423ba301acf3e30aba5a186d01fbccdb40e5bd59c57c4e64177b"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::linear_scan_allocation (cognitive 20): Backend::linear_scan_allocation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e73809f8cee723c8b7dc0bc6560860f5d8c579a22016c8dd226f3a5af6d3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::undo_redo (cognitive 19): TextBuffer::undo_redo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d053e631b3db4e6e444bbe32971924cc6c679043e5f9361ee7b951c4b71ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::button_label (cognitive 19): Context::button_label has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 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":"crates/edit/src/tui.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c00dfa615ed6997d282f5adea76153af51b2b606f95c91da2f91989fb7d425"}},{"ruleId":"D2","level":"warning","message":{"text":"lsh::compiler::optimizer::optimize_noop (cognitive 19): lsh::compiler::optimizer::optimize_noop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/optimizer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7e6153a26eb8c5fa47006e1cf83d75dc2c97c780bf88da2c9e7c7c1555f0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream::parse_xterm_mouse (cognitive 18): Stream::parse_xterm_mouse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/input.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b49256614d21fc5e1f0d582c63e1debfa40ea33d396c0fa0f3b1a2052432d59"}},{"ruleId":"D2","level":"warning","message":{"text":"Tui::render_styled_text (cognitive 18): Tui::render_styled_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 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":"crates/edit/src/tui.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa1c1381116d52fa770200b7eb1c998586630620bf16763b2b9fdc1b433f18"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::visit_all (cognitive 18): Tree::visit_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d154b647a0a5acde887502c1993924fa0be346c2b02b269a8187556e6438e855"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::compute_intrinsic_size (cognitive 18): Node::compute_intrinsic_size has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (8 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed696ba76091486c5f1bbe65984adee99616a2b7b139d15bdc8be6a5e63c72f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::layout_children (cognitive 18): Node::layout_children has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), match/switch 3 (7 pts), boolean chains 1, if/else 1 (nesting depth added 9). 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":"crates/edit/src/tui.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07495c41aeede71ba410a54ed56a76dba7df1c6e87b65388f1df98812f007ba"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_menubar::draw_menu_file (cognitive 18): edit::bin::edit::draw_menubar::draw_menu_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_menubar.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ae39d00891e415d1f6e9184868c17528270ec7743e16d93931588470945b7"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_statusbar::draw_dialog_encoding_change (cognitive 18): edit::bin::edit::draw_statusbar::draw_dialog_encoding_change has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_statusbar.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"60af1d4cfa913dfbb5537512cab8f257e9374de69b0de7df92a1e68796996840"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::build::configure_icu (cognitive 18): edit::build::configure_icu has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 3, match/switch 2 (3 pts) (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":"crates/edit/build/main.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c5f1ffb485a6b8fd2746f249d24b7ec42c39e1365d6a102ebf53581fd55ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGen::emit_charset (cognitive 18): CodeGen::emit_charset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 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":"crates/lsh/src/compiler/regex.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21ca981685cd7fb3f4b58a73629488a5b301a56b2d7c050a3a77e020e30caad"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBuffer::indent_change (cognitive 17): TextBuffer::indent_change has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b39ebbb5218befe33abc5d57c4725c23e0e4c3798c866308090815a59343dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::block_end_move_focus (cognitive 17): Context::block_end_move_focus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, 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":"crates/edit/src/tui.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ccffc598c1ad09a4af978d9b1c80aba4f21697092df47a764789d861b801d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::menubar_menu_end (cognitive 17): Context::menubar_menu_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). 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":"crates/edit/src/tui.rs"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d048ae4ebb771bb41ff6cf2d5735359ab7bbe1bb64d80da88559e5173408c391"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::main::draw_handle_clipboard_change (cognitive 17): edit::bin::edit::main::draw_handle_clipboard_change has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/main.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb1693e25debd34decedbc4cb8aa3a65b78437a8a817e0cddf9bbe815c6d310"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::simd::memset::memset_lasx (cognitive 17): edit::simd::memset::memset_lasx has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720be48c92e4b1097cb4c1bd8040a1df064e01ec9709be25b61f25bb6cd2fba"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_if_comparison (cognitive 17): Parser::parse_if_comparison has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2f84aaa9e31b3571d082bd5b7165e4b47fff73aefff4d4bca6e3cfc858f0f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::load (cognitive 16): Settings::load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/settings.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f21d34c0524539cb1c91d458d6cdeeb2303730b468025543764870ff4a2f6af"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::bin::edit::draw_filepicker::update_autocomplete_suggestions (cognitive 16): edit::bin::edit::draw_filepicker::update_autocomplete_suggestions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 2 (5 pts), match/switch 1 (4 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":"crates/edit/src/bin/edit/draw_filepicker.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a651c5103f7a2ad6f3fab6acbafc501e045d156e7ddeaf391131fe802e99ad"}},{"ruleId":"D2","level":"warning","message":{"text":"edit::simd::memset::memset_avx2 (cognitive 16): edit::simd::memset::memset_avx2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f1c01bbe1554f58a4097cd26def8eaabfac31007b096286cd699c837e73883"}},{"ruleId":"D2","level":"warning","message":{"text":"Charset::fmt (cognitive 16): Charset::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 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":"crates/lsh/src/compiler/charset.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d2959def7f4594b07566323a4062fc45006759cda69513c0bfb63144a54477"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGen::emit_repeat (cognitive 16): CodeGen::emit_repeat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/regex.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82ac67318d583c96b042202a514563d07971b9a8316dc2f0143254ec9be4835"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode_gen::build_trie (cognitive 16): unicode_gen::build_trie has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6bc86f229ca9b6f703e90740f10448c02032c31847d1fe161f55cfd065b274"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tui.rs: FileTooLong \u2014 2343 significant 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 1843 over it, 4.69\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":"crates/edit/src/tui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4926949183d0be81c60228a822161eeb3ad338f28722dc0d76fba8b4cf8eead4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TextBuffer: ClassTooLong \u2014 1680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 119 methods, 2 blocks, lines 271-3288. The bar is 400 significant lines; this is 1280 over it, 4.20\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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c6ad27045fdab84c7d9bf312aea1d4c71c0f8edf8ddd255a2a6cd0d5dd578c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextBuffer: TooManyMethods \u2014 119 methods. The bar is 30 methods; this is 89 over it, 3.97\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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bdf8042a695cc647c6677585e7a7f0db2751730bd2d3bcb83c76c3f6150374"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: buffer/mod.rs: FileTooLong \u2014 1901 significant 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 88% of them inside a single declaration: TextBuffer (2 blocks, 271-3288). The bar is 500 significant lines; this is 1401 over it, 3.80\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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"195191884a1cd9c0f43f0f4dfd808bf171933ecc4dc6e67b49b884dbc3564d32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Context.textarea_handle_input: MethodTooLong \u2014 textarea_handle_input runs 351 significant 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 251 over it, 3.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":"crates/edit/src/tui.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab33c6e5e3357f8ecc8b4d90e2c466f6bf0af95f40993bdce6ce7ed8f9d8322b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Context: ClassTooLong \u2014 1207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 78 methods, 3 blocks, lines 1378-3441. The bar is 400 significant lines; this is 807 over it, 3.02\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":"crates/edit/src/tui.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa572b47001937cd1b030cb9595d815f9403e4e89654838d6526ce0d33276a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: TooManyMethods \u2014 78 methods. The bar is 30 methods; this is 48 over it, 2.60\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":"crates/edit/src/tui.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1a67821ee38e91044a1eef627af656150fc3cc3a0d69e1f54dadc0450b2be6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextBuffer.render: MethodTooLong \u2014 render runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"827e73b3f552508b4008d7619e217212dd35c538a17d7570dd3201e593857830"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MeasurementConfig.measure_forward: MethodTooLong \u2014 measure_forward runs 171 significant 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 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/unicode/measurement.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a954cf520605d28b927ecd1c66292f883874f52b853255475b0d2e1430de59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/icu.rs: FileTooLong \u2014 823 significant 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 323 over it, 1.65\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":"crates/edit/src/icu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfad540c6501fbd5924c38a00c87b41bbe62baa68d1eb23f80aa844b448e924"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tui: ClassTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 2 blocks, lines 303-1374. The bar is 400 significant lines; this is 234 over it, 1.59\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":"crates/edit/src/tui.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f99d28c50130442a69083dc0f48ee749dbdc0907b8376a45390c17d4ff55edc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: edit::bin::edit::draw_filepicker::draw_file_picker: FunctionTooLong \u2014 edit::bin::edit::draw_filepicker::draw_file_picker runs 157 significant 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 57 over it, 1.57\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":"crates/edit/src/bin/edit/draw_filepicker.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc1b7109759c87a313978b0eea2e8b56fae444e5f5ad2cb56eb1b5eaceb4228"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: unicode_gen::generate_rust: FunctionTooLong \u2014 unicode_gen::generate_rust runs 157 significant 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 57 over it, 1.57\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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b763ac942e1896c6f35f18a5490114e75ef161b59d21cdc8db099c132689459d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 756 significant 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 256 over it, 1.51\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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62736d7c2d728e2bc538ffa1b265c282f2d1925735687fe1f8b543c05655d55e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tui.create_context: MethodTooLong \u2014 create_context 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":"crates/edit/src/tui.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aaaefe874c6a52158c3d7eccc09703249d67d4947e72ebd70b9f216b421be7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: unicode_gen::generate_c: FunctionTooLong \u2014 unicode_gen::generate_c runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed366415c05a421f74f4e42b856ebef9b1b603b15f5adaec9764ebcca551284"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 over it, 1.31\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":"crates/lsh/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8955e2a19a6dc9cb6ecc8d5d4cea5d2d516b5fb1a23cc20726489d4ad01b14b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: 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":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84e5a97e3a751d879133a0124947e2717aec874e0cecb6b7a819d67600fad1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: edit::bin::edit::draw_statusbar::draw_statusbar: FunctionTooLong \u2014 edit::bin::edit::draw_statusbar::draw_statusbar runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/bin/edit/draw_statusbar.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5618b2dfbeb1bd53d20020981e41779f1b46eaf758081fe1fafa33a7de977e40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: unicode_gen::extract_values_from_ucd: FunctionTooLong \u2014 unicode_gen::extract_values_from_ucd runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4018ab3adcd7aeb8a7629212932331afa196b8ee2255a4195371639068f390"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 2 blocks, lines 47-836. The bar is 400 significant lines; this is 109 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bf160e35281b9872db2983f8898775fc9709a97fc6e7e228789ddd71753d6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tui.render_node: MethodTooLong \u2014 render_node runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"497d2dba7502d07502d27ac328868047def79f7b6ad7d7f239821b19ce17d386"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: State: TooManyFields \u2014 37 stored fields beside 2 methods. The bar is 30 stored fields; this is 7 over it, 1.23\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":"crates/edit/src/bin/edit/state.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef167a3ae21d848a3ba717283aafbc1039d3f0aa362cfa2a3a5bacd0e71296c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BVec: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"crates/edit/src/collections/vec.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5801c384b25f394062d6b21adedc1d91c08b57132f7bd1d0dce97c40632f7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stream.next: MethodTooLong \u2014 next runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/vt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb512ca0cc8c029db9af38d1dd8b72dc8322a1ac67b0722936611fc256b83fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/framebuffer.rs: FileTooLong \u2014 567 significant 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 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8ba2ad1ff0a3d1d32d1da9680fa2cb5f620f3bc3d74dc6e4e08e04e6867d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tui: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ee0cc1e3f37d2d04879bcf858c930eda11baefbcd6d2d7a16bc63af7ac7a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Framebuffer.render: MethodTooLong \u2014 render runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72e4cf5978dee938c3b63927ab8d92acf8b5a91d3544b55289aeacd083e94e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stream.next: MethodTooLong \u2014 next runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/input.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5de8147a927a06ea883031c7929af5b252245907e09147176d14e08c1e14095"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TextBuffer: TooManyFields \u2014 32 stored fields beside 119 methods. The bar is 30 stored fields; this is 2 over it, 1.07\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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"13299f1f74e2bd2960ee004d25d90bdc8f7e2a948fe8afa0b66ecf32efefdf73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/frontend.rs: FileTooLong \u2014 532 significant 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: Parser (2 blocks, 47-836). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd646f3c66e19349b3d073630c0d4712d8ccb2e371d7e5c01b179e4d8b49037"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: edit::sys::unix::read_stdin: FunctionTooLong \u2014 edit::sys::unix::read_stdin runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/sys/unix.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"159c803af5f129b0d05ed98dd399172c4501233b631824b47a97b6877c6bfe75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.generate_code: MethodTooLong \u2014 generate_code 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":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec2a27eeda3ad6ed40091af93533736b38bc1dd5f17b57abc2077aecdf1642d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/edit/src/simd/lines_bwd.rs:95-163 | crates/edit/src/simd/lines_bwd.rs:192-258 | crates/edit/src/simd/lines_bwd.rs:267-331 | crates/edit/src/simd/lines_bwd.rs:339-393 \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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab953ef1c3d522c81585696f40fbe65a01131374d2f770c233cb57d8b3892d01"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/edit/src/simd/lines_fwd.rs:95-170 | crates/edit/src/simd/lines_fwd.rs:199-263 | crates/edit/src/simd/lines_fwd.rs:272-334 | crates/edit/src/simd/lines_fwd.rs:342-396 \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":"crates/edit/src/simd/lines_fwd.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed71a1e3a96a4a3243bb08a6e86290daf9bb80d791ff04b1e43397c72858e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (193 corresponding lines): crates/unicode-gen/src/main.rs:337-529 | crates/unicode-gen/src/main.rs:531-750 \u2014 These two members are one piece of code written twice and then edited apart: 193 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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2750df4d5ce678f1a1076e70f5c219ac28d8c51e0ad27f99ab748d9d89ddd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/edit/src/simd/memset.rs:241-297 | crates/edit/src/simd/memset.rs:301-344 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cecf5231dd8a3f69177aa3e5add3f3cb35320072b8cb65cdfdc558ffd463084"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/edit/src/simd/memset.rs:109-154 | crates/edit/src/simd/memset.rs:158-222 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c4512b6cd575f0a9bb6f156e8a6fc8b7197541aa3e8675b588edec5230addd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/edit/src/json.rs:344-382 | crates/edit/src/json.rs:384-433 \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":"crates/edit/src/json.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8722d61d2dd4a59151d0c0aa1429aa4185e317f60119efbbe5bed2ecd295a683"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/edit/src/simd/memchr2.rs:124-155 | crates/edit/src/simd/memchr2.rs:159-188 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"crates/edit/src/simd/memchr2.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"947c8688d3ce9a3376da448ca275e0bc2564dca9bcb42a52778caa89c429b927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/edit/src/collections/vec.rs:427-459 | crates/edit/src/helpers.rs:231-263 \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":"crates/edit/src/collections/vec.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac0a20276a79fda7f0b173f676712967e6589a8988bfd82a3992638dad51aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/edit/src/arena/release.rs:109-128 | crates/edit/src/arena/release.rs:132-157 \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":"crates/edit/src/arena/release.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde9ba70325923e764b2f216ce78369dbfc7dd799749eed8ae0ef9ed3cbc9474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/lsh/src/runtime.rs:304-326 | crates/lsh/src/runtime.rs:330-355 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"crates/lsh/src/runtime.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f58810f9a727850ca5b1837040bf7aff664d8f5bd7fa94f53a93d465b144f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/edit/src/tui.rs:2000-2013 | crates/edit/src/tui.rs:2016-2029 \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":"crates/edit/src/tui.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff9de01d845c6b9f4801a285d0d42e828670f24753f505a7a7dac95febcb0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/edit/src/tui.rs:3883-3894 | crates/edit/src/tui.rs:3898-3914 \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":"crates/edit/src/tui.rs"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"058367de70368b4f0c0f75b9f6cdf632e1a4ae70688e35c69055da5336cf5b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/edit/src/collections/vec.rs:377-389 | crates/edit/src/collections/vec.rs:411-423 \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":"crates/edit/src/collections/vec.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6217cdbf391d8ceecb8fd5738ee92a2d5d780434229a18376ba4014d296470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/edit/src/bin/edit/documents.rs:29-47 | crates/edit/src/bin/edit/documents.rs:49-63 \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":"crates/edit/src/bin/edit/documents.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"60374981d7df2b6ac5575d26c4c827180b9a317414c01aa88435872a039ad14a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/lsh/src/compiler/frontend.rs:297-308 | crates/lsh/src/compiler/frontend.rs:310-321 \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":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b578ddae392f626c7c7177e6a13c490429a533f8bcdb8b614f2a34860648de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/edit/src/collections/vec.rs:206-223 | crates/edit/src/collections/vec.rs:227-238 \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":"crates/edit/src/collections/vec.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f926149f5b5faefa22df08884cd1df452aea161630311d39012dfc957e2162cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/edit/src/simd/lines_bwd.rs:36-45 | crates/edit/src/simd/lines_fwd.rs:34-43 | crates/edit/src/simd/memchr2.rs:25-34 | crates/edit/src/simd/memset.rs:54-63 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0528fcb0a2b00954a18a8edbf8f5d68e9a27cc32b5b8b68e198f66672e6f055"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/edit/src/simd/lines_fwd.rs:19-27 | crates/edit/src/simd/memchr2.rs:13-23 \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":"crates/edit/src/simd/lines_fwd.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d126763e0f5585e97763831bdd635c0d486ea6d825b928d49286166779a06101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/edit/src/buffer/gap_buffer.rs:376-388 | crates/edit/src/buffer/gap_buffer.rs:390-402 \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":"crates/edit/src/buffer/gap_buffer.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"302eaffc0336add15145b38388d601fad8ee06936f21b0a807d2eb16cfa42315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/edit/src/icu.rs:589-597 | crates/edit/src/icu.rs:599-606 \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":"crates/edit/src/icu.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"493c9bea86c5d1a37106332e8c59e2d455e2ae823ac91a96c5050548881e4cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/edit/src/collections/string.rs:247-252 | crates/edit/src/collections/vec.rs:335-340 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/collections/string.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"76847defccb58314e6788b68424a1fbb0b45286288c6c61e7d8719e2da49d5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/edit/src/arena/fs.rs:53-59 | crates/edit/src/helpers.rs:278-284 \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":"crates/edit/src/arena/fs.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"41936763487af37c30aa553eda1ae4e9ef1d0762096ea022d140ee7ce63d71e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 2): crates/edit/src/unicode/measurement.rs:209-247 | crates/edit/src/unicode/measurement.rs:388-427 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/unicode/measurement.rs:209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/edit/src/unicode/measurement.rs:248\u0060 calls \u0060cold_path\u0060 and \u0060crates/edit/src/unicode/measurement.rs:428\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":"crates/edit/src/unicode/measurement.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"841460098a8636a1724ca020a4a74f122cde73929f6b643e42aacbef1d417d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): crates/edit/src/unicode/measurement.rs:185-207 | crates/edit/src/unicode/measurement.rs:361-386 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/unicode/measurement.rs:185\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":"crates/edit/src/unicode/measurement.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"77769b39b1517532961d497b004f53dfb2bb7351640a0103808487c33bbe0f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/edit/src/simd/memset.rs:137-154 | crates/edit/src/simd/memset.rs:205-222 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/simd/memset.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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af46ee879207c2afccf7ed5854e4cd7626fd9cd40018a71c32465d72e562725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/edit/src/simd/memset.rs:280-297 | crates/edit/src/simd/memset.rs:327-344 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/simd/memset.rs:280\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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6cac1107cfc68d36de66fe125df71ea68c713c7578f640e30d3553bd691762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/edit/src/simd/lines_bwd.rs:193-209 | crates/edit/src/simd/lines_fwd.rs:200-216 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_bwd.rs:193\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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71458114bd1d7d30f022386707f54dbf03af421b01b2990b7b85044f6030d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/edit/src/simd/lines_bwd.rs:96-111 | crates/edit/src/simd/lines_fwd.rs:96-111 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_bwd.rs:96\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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7351ece226ec338619e8c3bf83285a6d31aac155c2e1f3491c3537d1433da70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/edit/src/framebuffer.rs:878-892 | crates/edit/src/framebuffer.rs:981-995 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/framebuffer.rs:878\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":"crates/edit/src/framebuffer.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fb3882cb6bcbedf6637909aa6b12a059bc9f9931fae81b31e50c551ae23de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/edit/src/simd/lines_bwd.rs:121-132 | crates/edit/src/simd/lines_fwd.rs:122-136 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa7f5ba96b1c7a9c94b1314b7f58a2fa5ef7f5818bbbe80c95c4256ebe4ea70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/edit/src/simd/lines_bwd.rs:268-282 | crates/edit/src/simd/lines_fwd.rs:273-287 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_bwd.rs:268\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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"83055b930602ac613d9e4a60fd5be54d7efb8c03c9a848e227086cba28b234f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/edit/src/simd/lines_fwd.rs:249-263 | crates/edit/src/simd/lines_fwd.rs:320-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 \u0060crates/edit/src/simd/lines_fwd.rs:249\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 \u0060sum\u0060 to \u0060m256i\u0060 in one and \u0060m128i\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":"crates/edit/src/simd/lines_fwd.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87d67652bcd7885739fe1b226951ec7184d80be34e1bb8b916bcb2a730a1b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/unicode-gen/src/main.rs:346-356 | crates/unicode-gen/src/main.rs:537-550 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/unicode-gen/src/main.rs:346\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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad53b2409c19ff37da2ef0bf96d3f4067c4f8229fd2ae035b5d8effb7dae17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/edit/src/simd/lines_bwd.rs:228-240 | crates/edit/src/simd/lines_bwd.rs:301-313 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/simd/lines_bwd.rs:228\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060sum\u0060 to \u0060m256i\u0060 in one and \u0060m128i\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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b49faab7986d18ebd0b85a2e7ad8a62e4b3e41153f2a023189a247b9ca264e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/edit/src/simd/lines_bwd.rs:354-364 | crates/edit/src/simd/lines_fwd.rs:355-367 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc00ce9617982b542a96b278dfee6d73f1aa355253a6c3166fee901905cbb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/unicode-gen/src/main.rs:513-525 | crates/unicode-gen/src/main.rs:723-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/unicode-gen/src/main.rs:513\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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222a4f246cc9bf7aeba4e7e1f49a3acf69a507bd01975b9ea07b933f752cda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/edit/src/collections/vec.rs:430-441 | crates/edit/src/helpers.rs:234-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 \u0060crates/edit/src/collections/vec.rs:430\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":"crates/edit/src/collections/vec.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00161265a471b72eec042eca51da2ce7547647ef829d50190c9f2137e5ce549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/edit/src/simd/lines_fwd.rs:233-244 | crates/edit/src/simd/lines_fwd.rs:304-315 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/simd/lines_fwd.rs:233\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060sum\u0060 to \u0060m256i\u0060 in one and \u0060m128i\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":"crates/edit/src/simd/lines_fwd.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d6aefd7a75005ead5a28c322617360149bc1e3dc114771a0d8f18cf92e184b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/edit/src/json.rs:346-356 | crates/edit/src/json.rs:386-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/json.rs:346\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, \u0060crates/edit/src/json.rs:357\u0060 calls \u0060Some\u0060 and \u0060crates/edit/src/json.rs:397\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":"crates/edit/src/json.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7414284bff3c5993e9d6f69d8ff6a1f8434a341fc2e17e31ca545fda503eb6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/edit/src/collections/vec.rs:378-387 | crates/edit/src/collections/vec.rs:412-421 \u2014 both copies are in the same file, so extract the block 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":"crates/edit/src/collections/vec.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5182ed55d547b08df42275e026958af1207c237b642ee9cc8eb0019952f1635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/edit/src/simd/memset.rs:78-89 | crates/edit/src/simd/memset.rs:379-390 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/simd/memset.rs:78\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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4529d444f16b44b2aeec3d90e3547e718ca026aa7264cab62b9110b5548e88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 4): crates/edit/src/simd/lines_fwd.rs:112-120 | crates/edit/src/simd/lines_fwd.rs:217-223 | crates/edit/src/simd/lines_fwd.rs:288-294 | crates/edit/src/simd/lines_fwd.rs:347-353 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_fwd.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/simd/lines_fwd.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b3ac3a6bf8d1ca0c80e0ff911153af64a8968c7bfeef23237d507ade31a498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/edit/src/tui.rs:890-898 | crates/edit/src/tui.rs:909-917 | crates/edit/src/tui.rs:931-939 \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":"crates/edit/src/tui.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0e3ab348e8b3524737173c0e0e336e7313782885c9d484babf23ed87e3cc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/lsh/src/compiler/generator.rs:106-114 | crates/lsh/src/compiler/generator.rs:240-248 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/lsh/src/compiler/generator.rs:106\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":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93fb65b2974301a69dfbf6fcd8ab3d11c7e27f53d639fd557130da97a9e3c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/edit/src/bin/edit/draw_editor.rs:240-247 | crates/edit/src/bin/edit/main.rs:508-515 \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 \u0060crates/edit/src/bin/edit/draw_editor.rs:240\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":"crates/edit/src/bin/edit/draw_editor.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e345c0d931a7cff18b9cf6f1516caf88e92991021489424cb07447a511ee3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/edit/src/simd/lines_bwd.rs:112-118 | crates/edit/src/simd/lines_bwd.rs:211-217 | crates/edit/src/simd/lines_bwd.rs:284-290 | crates/edit/src/simd/lines_bwd.rs:345-351 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_bwd.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d66e1e04e90d1245cedd27945d613e2d3ba53e1e2da109fd86e6871137ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/edit/src/bin/edit/draw_editor.rs:238-243 | crates/edit/src/bin/edit/draw_filepicker.rs:207-212 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/edit/src/bin/edit/draw_filepicker.rs:206\u0060 calls \u0060attr_overflow\u0060 and \u0060crates/edit/src/bin/edit/draw_editor.rs:237\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":"crates/edit/src/bin/edit/draw_editor.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"040a7a89a57d801e3c8c9ec9bdea9a9db51dd9adf5025e33fb2a1383417ab628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/edit/src/bin/edit/draw_statusbar.rs:216-222 | crates/edit/src/bin/edit/draw_statusbar.rs:368-374 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/bin/edit/draw_statusbar.rs:216\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":"crates/edit/src/bin/edit/draw_statusbar.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"670b185d2f2b02d73773cee765dd730a0052ed4e9c4b0d67dcb819cacfe060f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/edit/src/tui.rs:2001-2006 | crates/edit/src/tui.rs:2017-2022 \u2014 both copies are in the same file, so extract the block 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":"crates/edit/src/tui.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"35184598fb3c52509060810810e5145dde271684e8bc59ad05baf6dfb4685821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): crates/edit/src/tui.rs:4020-4025 | crates/edit/src/tui.rs:4035-4040 | crates/edit/src/tui.rs:4102-4106 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/edit/src/tui.rs:4025\u0060 calls \u0060outer_to_inner\u0060 and \u0060crates/edit/src/tui.rs:4106\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":"crates/edit/src/tui.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"893bdc872b7bc10b195b1c30a6a93ff3480c2a6d3c097b4d32d6ca89cb6fac07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/unicode-gen/src/main.rs:359-364 | crates/unicode-gen/src/main.rs:555-561 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/unicode-gen/src/main.rs:555\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":"crates/unicode-gen/src/main.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc17fe207760e903f428bdb71d58c8e29698985d4d0a64ee84600782549f6e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/edit/src/simd/memset.rs:34-38 | crates/edit/src/simd/memset.rs:40-44 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/edit/src/simd/memset.rs:34\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":"crates/edit/src/simd/memset.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1792a3ad778c2b535c4858cf661f08e5af687b7a71e5cd3c0f2f3eb954dadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/edit/src/simd/lines_bwd.rs:82-86 | crates/edit/src/simd/lines_fwd.rs:82-86 | crates/edit/src/simd/memchr2.rs:67-71 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_bwd.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"022d8edf34cc5523959f3d1216a6e3eda2ae1deb54e1f5f035ab9a89b62d2696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/edit/src/simd/lines_bwd.rs:171-183 | crates/edit/src/simd/lines_fwd.rs:178-190 | crates/edit/src/simd/memchr2.rs:108-120 \u2014 before extracting anything, compare \u0060crates/edit/src/simd/lines_bwd.rs\u0060 and \u0060crates/edit/src/simd/lines_fwd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/edit/src/simd/lines_bwd.rs:171\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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d97f338014f7625c7122384f8cb5d35fd60dec3218264b7b59be8447718a477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/edit/src/arena/release.rs:120-124 | crates/edit/src/arena/release.rs:148-152 \u2014 both copies are in the same file, so extract the block 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":"crates/edit/src/arena/release.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"efebd320fdb7994e00c91b5b97efa5285b16960a696f0f53a5c283bc7b1c0cc0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: lsh: lsh: abstractness 0.05, instability 0.00, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e9df1c446620e68070201b81008bebb765da255422be03526d7720abf9052fc2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/alloc.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd72ebd42c99e32a220068e540205ccb3ce9576ade136b95c2588a19b0227e35"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/arena/fs.rs: 0.0% line coverage (0/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/arena/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee0bb4c06eb0d74545b27ccaac083f36c1305e7bfd616f93b263e4585cad57"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/collections/string.rs: 30.1% line coverage (59/196)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/collections/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4ba3b9ee5d0e3223f6f977461b9a0bfd220c8b41e63099fb034437370843d4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/collections/vec.rs: 30.4% line coverage (116/381)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/collections/vec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dba82f91a9b2eb704e4fb9ba57e02edca0193a227305c79bbc2cd1bcb6a1d2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/document.rs: 24.2% line coverage (8/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3f30341ccbfede75351770a7b2368ee550172a8bcc5c8e7c361e3b30c921b4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/framebuffer.rs: 45.7% line coverage (246/538)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"605910ea2e463c79c1dabddff27606462762294ea7082d26e20b658ba1bb7341"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/fuzzy.rs: 0.0% line coverage (0/129)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/fuzzy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe92ac399e726b82c0736c973edc74250978f5dacfa268880ad3f2c14d9db7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/icu.rs: 5.8% line coverage (32/555)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/icu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e61bdd4ae63da10c113a1e6db74f555013a5237879ded07eec88efa33b9aef1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/input.rs: 0.0% line coverage (0/213)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf4cbaa8bdd304de0a08a2fd7977d09a0186043d7715ef6cf1905bcba32f543"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/lsh/cache.rs: 20.5% line coverage (9/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/lsh/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecb864ca8289e97feda3a1a1b3f78b076413f6c8be968c07e5ebc1c187f8099"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/lsh/highlighter.rs: 0.0% line coverage (0/78)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/lsh/highlighter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db9b50f571abc5bc5e73deeb20ebfc5d34fef8fe99dc34b0955118940c8658b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/lsh/mod.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/lsh/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9973332e2c4e850a7f1a815591b4740015f6111aa4e59afa96b5c3fca9ede2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/sys/unix.rs: 8.9% line coverage (34/384)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/sys/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cbc16e211396c31fe0f151acf5c6607b89e09b3fdf7025942b3f082ab8ac84"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/tui.rs: 25.0% line coverage (627/2508)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc95c0d945382be67bb8d80ee5326c8e11d700469a3b5e7d8443fcf24bbd3efe"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/edit/src/vt.rs: 0.0% line coverage (0/152)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/vt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d622809a7adb66721c60f7163a53654753a0c5fc9fb5eacfe598c3b4a5528a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/backend.rs: 0.0% line coverage (0/441)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"589c747386b99a0643d991ade1019c842a0befcb7e19ea161f092578d7abf055"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/charset.rs: 20.5% line coverage (27/132)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/charset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b60eb09ac7917f70fff8225c9e675d39004abad81fbecf492b18aa7cdcba061"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/frontend.rs: 0.0% line coverage (0/559)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90c429bcae1829a50714ec6f0b2a3c531d4f4702e6395a779fc2b1efc2aef19"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/generator.rs: 0.0% line coverage (0/227)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c75ae3b72eb89b9bd38890becbef7db9d0dc2ca444b2a6b34d39a67cd58c4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/index_vec.rs: 0.0% line coverage (0/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/index_vec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7e6d2383b2ea65ecee4e229cfe988709637cba6e3238f2a233e32a80695e99"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/ir.rs: 0.0% line coverage (0/172)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc338a4237202fd3ebc9ed29358ae0664b932098a756b569ad5064f65617c969"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/mod.rs: 0.0% line coverage (0/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"251988bfacf30ce61c8673ee4f488a64a25d8737ac44b85f4bb549992afde87b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/optimizer.rs: 0.0% line coverage (0/116)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/optimizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a768d651c0601700c62d9f2b776f6fb31ee6ba792f20a4add95bc7a53eaf9b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/compiler/regex.rs: 0.0% line coverage (0/430)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/regex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"217ba3722f208d81fee6ce486141a5d07bcf8b45c2923e47e53db3c43ecc237e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/main.rs: 0.0% line coverage (0/125)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4e4fb9414bfea9c28621d1781cf4b432f71d82712e653c69956cdb6d1f6152"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/lsh/src/runtime.rs: 0.0% line coverage (0/425)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c20f89ec61659717e73b57410975eb1b302a43ca23dd3a8bb868d3b695a43ac"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/unicode-gen/src/main.rs: 0.0% line coverage (0/737)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11319dbfeb87e59dd3f5f561ef2c8a0f617d3588ae8b092aba88b6ef56bda6ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/edit/src/buffer/mod.rs: crates/edit/src/buffer/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in TextBuffer::write at line 2347. 4 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 22:19:22 \u002B01:00\u0027 --until=\u00272026-11-02 22:19:22 \u002B01:00\u0027 --full-history --no-merges -- crates/edit/src/buffer/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c6005a29216f7ba029e1330b619e0e27e980be6af0a5d0c675d97ae7750dff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/edit/src/sys/unix.rs: crates/edit/src/sys/unix.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in edit::sys::unix::read_stdin at line 282. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 22:19:22 \u002B01:00\u0027 --until=\u00272026-11-02 22:19:22 \u002B01:00\u0027 --full-history --no-merges -- crates/edit/src/sys/unix.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":"crates/edit/src/sys/unix.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d75ab928e324a0806514845083e854244895644ec626397d381bebe4e3db84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/edit/src/framebuffer.rs: crates/edit/src/framebuffer.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Framebuffer::render at line 473. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 22:19:22 \u002B01:00\u0027 --until=\u00272026-11-02 22:19:22 \u002B01:00\u0027 --full-history --no-merges -- crates/edit/src/framebuffer.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":"crates/edit/src/framebuffer.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbde9df6bfcbc4ee7c937c2ee0fe0ffbb72574a53308601f838d59cafc3fd84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/edit/src/icu.rs: crates/edit/src/icu.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in edit::icu::utext_access_impl at line 434. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 22:19:22 \u002B01:00\u0027 --until=\u00272026-11-02 22:19:22 \u002B01:00\u0027 --full-history --no-merges -- crates/edit/src/icu.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":"crates/edit/src/icu.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a30de79c1225e2487d60b6325800661d58604cc96fa8b05a9c91b6420a29df"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 18 significant file(s) lose their only recent owner: crates/edit/src/framebuffer.rs, crates/edit/src/unicode/measurement.rs, crates/unicode-gen/src/main.rs, crates/lsh/src/runtime.rs, crates/lsh/src/compiler/frontend.rs, crates/lsh/src/compiler/backend.rs, crates/edit/src/collections/vec.rs, crates/edit/src/json.rs (\u002B10 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a5d1cd06d1984e1a81531945e8f3ec6ecbba4c7c1250d5e0bfe846a024dbb0c4"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 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 (20 single-owned of 49 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; 49 of the 69 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (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: assets/highlighting-tests/rust.rs, assets/highlighting-tests/csharp.cs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I should go through this and cross check: https://www.unicode.org/Public/draft/ucd/auxiliary/LineBreakTest.html"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/rules.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ac31b4d41fc3eadfafb57504b24142ea449e86b4f169a11edb267539871db"}},{"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":"crates/lsh/src/lib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b358029a63b6c56ec8c3010101c57af312a9905d78b8126c166d33a93948455"}},{"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":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d68d7edc8600384af0c1d9bf5d513da5ad7e6f11dde720a96b58119a1490f7"}},{"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":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"db95384651294ebba65c7742206ee1b290de5826cab85a263c07186a878a9d85"}},{"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":"crates/lsh/src/compiler/optimizer.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6768d933aa2143ed2e974089aadbf242330df3beaa509b97af987f76f17901f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: http://0x80.pl/notesen/2018-10-18-simd-byte-lookup.html#alternative-implementation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/runtime.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef0f9d7992f9e4f0c3768a1236f497f89d3251f7d961859a173583a7e28e69c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: current interval gets spilled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"296d32260ffff147531b4688b397a2c2afe14613ca67bbdb61057c1160634396"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If you think about it, this should kinda go into optimizer.rs, because it could \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/backend.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef361efaa06b69e632a7cf934aed9e711d27e727148ecec2418fddafc3c34f82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a bit inoptimal to always allocate a noop node \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/frontend.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73603282f11f13ba94375378f777e9eb8a2069a7a265219fa92be949271d958"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is kind of stupid. There should be per-instruction annotations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"659bcc896790d14a418aa9e4091aa992477140b718f981e3f2a1ba60966eafdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is kind of stupid. There should be per-instruction annotations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/generator.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8450a73cc62e39d42429f00d9a91cefeb90024d374b30485a499c1c545e3f91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Technically we could also optimize vreg --\u003E vreg assignments, but for that we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsh/src/compiler/optimizer.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb092e64d8427734f128f9199093d7bd9864a79699f599ddc6e9e1a31b394f38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: The current approach blends foreground/background independently, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfabdc656aac9e4439f7d473d7958d0ce4dffe2b81184ad1de4e2ca1075a576"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: The current approach blends foreground/background independently, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e621ecf93b3522804e5bf5c01774a38bbf901526bad3d4c2293c06736302d8ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally, we should properly diff the contents and so if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/framebuffer.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5b16d2da4b803d400736c2f7c5ae5e2b2ab3c029462675e3e7911198566b65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I\u0027m somewhat unsure whether we have to preserve the \u0060chunk_offset\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":"crates/edit/src/icu.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea10a7be3e33c1430147c9936e08097b76a435f68de26f04ac3ccaa04a16a3c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Due to borrowing issues in stable Rust 1.99 (and possibly subsequent versions), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/icu.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"481b0caa50834b6f49f80898014cfc7d21e1f82ce320343927a79b32b7e9e5b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It may be worth avoiding this if requested 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":"crates/edit/src/icu.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"5402ee60ae45076c97b1af4289539c2260ba735c4726634934655153b4065389"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: What\u0027s a good heuristic 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":"crates/edit/src/icu.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"399aa5787916a0b78efade8690d62e7bf8f262784cd540944b7f3b140c11a5f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Is this a good idea? I did it to allow typing \u0060kbmod::CTRL | vk::A\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":"crates/edit/src/input.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"19711de66a35c17f567d20299fb5b6ab4f5420b5e05f282c8fcf974be927bf3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the .len()==1 check causes us to ignore keyboard inputs that are faster than we process 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":"crates/edit/src/tui.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3676a6b4d6dfb8968b5105fd3e324d1f5c896c731face6cfc08b52b53fca9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There should be a way to do this without unsafe. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4f540ef87489e38effb1a89938fdcb2ea27b20553ce3c405002c6e99c5eee7"}},{"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":"crates/edit/src/tui.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8c3eba9496e353d2d17e4aa62cbd93629388f60df1716293a7644eaa361450"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: HashMap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fc266247f43132600fb6c7a0ab3d2a1e3fb02fe0c78a291e885a085b4a0aec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Untested because Windows Terminal surprisingly doesn\u0027t support Shift\u002BClick. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":2365}}}],"partialFingerprints":{"codehealthFindingId/v1":"72be6c3fbafc705d4bc19610bb6688c47124852b35c62b5ef0405c27bf9685a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add cursor above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5f0a7096eb478979ac9c4c38de3ea6dbb37ad75245b908ae86a341f074045d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add cursor above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"c196813a0b3a5ad5c0a07a20bf13858f6705aaab1ad8f7dd7eb101741416e2e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should reassign the previous focused path. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2869e27c0a88c7cc8eb791d46f82c42b2fcbe8d45165a27504459ae3172e059"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The latter is computed incorrectly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/tui.rs"},"region":{"startLine":3934}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ddffc3f3b0a6b9abb08237538a631c971bc252c4b1aa3af5bf0c7641e096ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The state machine can be roughly broken up into two parts: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/vt.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a9863ffd85d17f761e6deaa670c9e0ba7dcaaeda2f2c405370251d958eb1d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: This reminds me that the sys API should probably be a trait. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/sys/unix.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"36041945eac192a4ecf937fd0768bb62ad9a8f2bf831f5d025168b90d4fd82b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get rid of that \u0060State\u0060 global. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/sys/unix.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7be3d85192eeb31ae6a86c80b5fde689d42c8531375f25bf0fe96ef73a376c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Instead of having a specialization for small buffers 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":"crates/edit/src/buffer/gap_buffer.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39d6e1b75333542be2b1cab23570d33e2d08e64613ed24c022d0ee6498e7cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Ideally we would only lazily reserve virtual memory, such that this doesn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/gap_buffer.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2a5b7587b851701f26a0947325168140bc09a520be5beb92e10aa2b8a31341"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This function shows that [\u0060TextBuffer\u0060] is poorly abstracted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee26e33ae4e51fbd88474672f43308f907e5a328eb3b276bdcd1f719446a1b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Since reading the file can fail, we should ensure that we also reset the cursor 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d836719c8949f601180248cc654ec060e0b7065630536239a958a52bf8fa450"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Doing this char-by-char is bad for 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":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"556e4d7172cffbf0aa85c4a77314b3de6f12c2c0112b82c4e60b41aa27b0a743"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This does an extra iteration, which we could avoid if we knew \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/edit/src/buffer/mod.rs"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eed6ccbcae36f6907162e6c62b4f94826028c11f0f524065ab2380d5d9272b"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/unicode-gen/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/unicode-gen/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf26632f4431d646787605f9de2523fc8a8eff2cd835f4807635e2b587c3b8a"}},{"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":"bb4b5ef39faced2b4df0f072bd6e5f4e07fd31964b644e2977d3c9b3e36268b2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"de2d9815a7463cb04f634390aba381bb93f2c61a251adc76da143e5532cdc62d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"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":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch nuget/cargo: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060nuget\u0060, \u0060cargo\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0905e9d0c19ec70ded7526c04d1db2371762f5f2f9371784f5c4240cc1613bf"}},{"ruleId":"P4","level":"warning","message":{"text":"No deployment automation: No release automation was found in CI \u2014 neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a7f38718309412c2d2c2c0663260a3d160de9a5a60f3915755be16386d3f1e8"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060off != 0 \u0026\u0026 off \u003C end.offset_from_unsigned(beg)\u0060 appears character-identically in 3 files \u2014 crates/edit/src/simd/lines_bwd.rs, crates/edit/src/simd/lines_fwd.rs, crates/edit/src/simd/memchr2.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":"crates/edit/src/simd/lines_bwd.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"057d711234e97fdcfd75054cc51ecfd9b9836a5209e948cd6c4051eb23aaf056"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format\u0060 (in \u0060fmt\u0060) turns every \u0060Err\u0060 into \u0060\u0022\u0022\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":"crates/edit/src/icu.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"507390bcd5c52f27ab4d82cdc7564d4300cf65590802cc0cfc8697d7f046257d"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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/"}]},{"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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":6,"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."]}]}