{"$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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"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":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"iced_winit::run_action (cyclomatic 113): iced_winit::run_action has cyclomatic complexity 113 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: winit/src/lib.rs holds 3 of the 36 functions over the threshold \u2014 including the worst \u2014 and 163 of the 548 points over it (30%), 2.5\u00D7 the next-largest file (widget/src/markdown.rs at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"4204bdc1fe739c6c093b5ef41e8305c224b61bb1b98d658536102f98aa38d540"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_winit::run_instance (cyclomatic 77): iced_winit::run_instance has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: winit/src/lib.rs holds 3 of the 36 functions over the threshold \u2014 including the worst \u2014 and 163 of the 548 points over it (30%), 2.5\u00D7 the next-largest file (widget/src/markdown.rs at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8418265e1a152b65e5e377e2adc7b73a8c23a8b49fe0372daa7f1d6eb7840b"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_widget::markdown::parse_with (cyclomatic 68): iced_widget::markdown::parse_with has cyclomatic complexity 68 (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":"widget/src/markdown.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7af6ed19354436a45a854fa4a539ea5dfab8a9bf567740aa09af4eb4d16ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_core::layout::flex::resolve (cyclomatic 56): iced_core::layout::flex::resolve has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/layout/flex.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e241c13e427d5e7a38db729333d2fdccb6bdc7eec0753ecd0279601c90ff297"}},{"ruleId":"D1","level":"warning","message":{"text":"State::interact (cyclomatic 46): State::interact has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/scrollable.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"96588ad26aabf25b1dd6546d89d7d83a6f7e2e742f134bc3cf35b253bbb263a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::perform (cyclomatic 45): Editor::perform has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b2e9b231d0486276d2353b5849e11d6d01f610fc1d883fef12e61a3f104227"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_beacon::run (cyclomatic 34): iced_beacon::run 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":"beacon/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb87156f42f733906f2a601fb4d94757dc66008e3f05e93cbf696e03f24b63"}},{"ruleId":"D1","level":"warning","message":{"text":"State::update (cyclomatic 34): State::update has cyclomatic complexity 34 (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":"widget/src/scrollable.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"2852ee7957c2cba5973e7db541ce0afe81b8f53572790db82a502d629197d335"}},{"ruleId":"D1","level":"warning","message":{"text":"State::update (cyclomatic 32): State::update has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"351dd49545fb979c92e5b9a6b73398db673614efd83179d7954276ab524b8ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"UserInterface::update (cyclomatic 31): UserInterface::update has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/user_interface.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea13940eddee3a087d8d6f4ca68e38cf4abf1e7fddb2292cbf84200c0812dea9"}},{"ruleId":"D1","level":"warning","message":{"text":"Binding::from_key_press (cyclomatic 30): Binding::from_key_press 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":"core/src/text/editor.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"922c37be4956cd6ef0c8353e4b3b96fae5de0a5d77d6fb7ecf2f02fb8fd85b41"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_winit::conversion::window_event (cyclomatic 29): iced_winit::conversion::window_event has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: iced_winit::conversion::key (cyclomatic 309) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/conversion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d65794051b17c4d9e2e15faebce0e59afb93404b8739c1ef2fbcb45f73c7271"}},{"ruleId":"D1","level":"warning","message":{"text":"Content::push_str (cyclomatic 28): Content::push_str 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":"widget/src/markdown.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"29140a16a9c2b48bdd4a708541f71d3633a76e4ec7a25f6b3e732e88a05bf14e"}},{"ruleId":"D1","level":"warning","message":{"text":"VerticalSlider::update (cyclomatic 28): VerticalSlider::update has cyclomatic complexity 28 (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":"widget/src/vertical_slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a914f91899859eee27225e8b2ffb5ccffc3c8aa78bd68ad6bcb4458dfd6458ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Slider::update (cyclomatic 27): Slider::update has cyclomatic complexity 27 (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":"widget/src/slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a4ab596546f3e8fe750d8c6b8d5a461aa7923ae19edb2d2a409c6ae035f451"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_widget::mouse_area::update (cyclomatic 27): iced_widget::mouse_area::update 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":"widget/src/mouse_area.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"710c030a8fa1b5317d6a2182008f23bb5de899887510ad8a527f6c6dcab2073e"}},{"ruleId":"D1","level":"warning","message":{"text":"ComboBox::update (cyclomatic 26): ComboBox::update 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":"widget/src/combo_box.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e5106c9ddfa0c03fe1af334f782f02b6d24f4945b497bb374edf7cf65c2d7"}},{"ruleId":"D1","level":"warning","message":{"text":"PaneGrid::update (cyclomatic 24): PaneGrid::update has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb090ae2990f414d4cb5b83815914ea4e708f93fd6d5fec22f4ccca4d42b3466"}},{"ruleId":"D1","level":"warning","message":{"text":"DevTools::update (cyclomatic 23): DevTools::update has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"devtools/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b889f9cfc8602f72858d97f46725efd3c728afcb0de6eccf00e6eb9a1ff746b0"}},{"ruleId":"D1","level":"warning","message":{"text":"PickList::update (cyclomatic 21): PickList::update has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pick_list.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"beff4036f191312ea45f24e59450ea52d298cf422d8a16308e3706e561669498"}},{"ruleId":"D1","level":"warning","message":{"text":"Scrollable::update (cyclomatic 21): Scrollable::update has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/scrollable.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"816b8f9734c810c7d520ff469aedd43df2af9742463b189926f7555fd2b99f58"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::layout (cyclomatic 21): Table::layout has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/table.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e6e2a355c4f17a64755ce528fe242eff49ddf4853b962fe954e4fc6fca6980"}},{"ruleId":"D1","level":"warning","message":{"text":"Tester::tick (cyclomatic 20): Tester::tick 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":"tester/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51fac6336a2edc2331bdadc1f574f72d528df5d25415d5faa5dc6915c049283"}},{"ruleId":"D1","level":"warning","message":{"text":"Sensor::update (cyclomatic 20): Sensor::update 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":"widget/src/sensor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8cdc237e068b198184f3f8f4de567d3a23b80f5d1fba841076e19957760574"}},{"ruleId":"D1","level":"warning","message":{"text":"Tester::update (cyclomatic 18): Tester::update has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Tester::view (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95498e2818202a00866ee5d040281d7a9aa2b4db1b42db6147e2334baa6f7a5"}},{"ruleId":"D1","level":"warning","message":{"text":"State::prepare (cyclomatic 18): State::prepare 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":"wgpu/src/image/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc97aceca25d1970387850fada592e27e8bca7941fe25023301f82c677556d6"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_wgpu::text::prepare (cyclomatic 18): iced_wgpu::text::prepare has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/text.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bc60bf0af20e693d35aecae5b1c04922681eff9f89e105de2d832c33b4c250"}},{"ruleId":"D1","level":"warning","message":{"text":"Scrollable::draw (cyclomatic 18): Scrollable::draw 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":"widget/src/scrollable.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"08678f47ac0a6f88c1cb5a577c3023b7b20da0cce67c2984cd12fd6111db2567"}},{"ruleId":"D1","level":"warning","message":{"text":"Rich::draw (cyclomatic 18): Rich::draw 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":"widget/src/text/rich.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b1cdeb78124ed929a2ddcde5e712b42c6c5bf8881938dede4d1246bd379f8"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_winit::run (cyclomatic 18): iced_winit::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: winit/src/lib.rs holds 3 of the 36 functions over the threshold \u2014 including the worst \u2014 and 163 of the 548 points over it (30%), 2.5\u00D7 the next-largest file (widget/src/markdown.rs at 66). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3122e0c18f9976c3dd878d2603070ed43acdcbf251839d23a12de2871b1c4de4"}},{"ruleId":"D1","level":"warning","message":{"text":"Input::update::apply (cyclomatic 17): Input::update::apply has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/input.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d32f71b057c487217a56a211aaef365aef18f0b6e99206df3337e9cff60bbf5"}},{"ruleId":"D1","level":"warning","message":{"text":"iced_graphics::image::load (cyclomatic 17): iced_graphics::image::load has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/image.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"498f4b92afcbdb678e58f964f66a15cd64b1162d31078c6bce5125e6e2b55fe0"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewer::update (cyclomatic 17): Viewer::update 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":"widget/src/image/viewer.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc446cb8e000ed79498315d78f848ddf243c8de14e2deed78519191f4f337f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::update (cyclomatic 16): Editor::update has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee56d8c826ce3f3c17ddad2f0fb81dff5b27e60937516eba46af30fd5588d6e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render (cyclomatic 16): Renderer::render 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":"wgpu/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"570fb1f7ae627112d52dc119fa9b1459f8d5b919de82881b6be5a0cf83e89860"}},{"ruleId":"D1","level":"warning","message":{"text":"TextEditor::update (cyclomatic 16): TextEditor::update has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 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":"widget/src/text_editor.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"84beb0ebcfde2518911206407e654f0867384a36eadafa2ef5365764fdeeaab0"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_winit::run_instance (cognitive 259): iced_winit::run_instance has cognitive complexity 259 (threshold 15). Drivers by points: if/else 40 (157 pts), loops 12 (53 pts), match/switch 10 (41 pts), boolean chains 8 (nesting depth added 189). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: winit/src/lib.rs holds 4 of the 63 functions over the threshold \u2014 including the worst \u2014 and 434 of the 1495 points over it (29%), 2.8\u00D7 the next-largest file (widget/src/scrollable.rs at 157). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d13ebad1e67691de39c3e8e4a74379616d233be3bed25cea9a2e6870982ede"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_winit::run_action (cognitive 186): iced_winit::run_action has cognitive complexity 186 (threshold 15). Drivers by points: if/else 47 (141 pts), loops 9 (23 pts), match/switch 9 (20 pts), boolean chains 2 (nesting depth added 119). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: winit/src/lib.rs holds 4 of the 63 functions over the threshold \u2014 including the worst \u2014 and 434 of the 1495 points over it (29%), 2.8\u00D7 the next-largest file (widget/src/scrollable.rs at 157). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b26639da8660c634594a1be1332e25f635d1ec13c012f4df4fd5901a6bb856"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_core::layout::flex::resolve (cognitive 106): iced_core::layout::flex::resolve has cognitive complexity 106 (threshold 15). Drivers by points: if/else 30 (59 pts), match/switch 12 (29 pts), loops 7 (11 pts), boolean chains 7 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/layout/flex.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13eab14b7d5a209bda06b7502523387d6eec26d38a0e0373d4ae273def58c87"}},{"ruleId":"D2","level":"warning","message":{"text":"State::interact (cognitive 101): State::interact has cognitive complexity 101 (threshold 15). Drivers by points: if/else 28 (72 pts), match/switch 8 (22 pts), boolean chains 7 (nesting depth added 58). 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":"widget/src/scrollable.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"815481fa5947f2e3e2b7e49df5ae8cce03bccd46337c00f3496dc2b576b34ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_widget::markdown::parse_with (cognitive 85): iced_widget::markdown::parse_with has cognitive complexity 85 (threshold 15). Drivers by points: if/else 29 (65 pts), loops 3 (9 pts), match/switch 5 (8 pts), boolean chains 3 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/markdown.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a23bf67028a6c5da943d356b4157cf1de01c602adf9192721f30451d8d4952"}},{"ruleId":"D2","level":"warning","message":{"text":"PaneGrid::update (cognitive 56): PaneGrid::update has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (39 pts), match/switch 4 (14 pts), boolean chains 2, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"18087583bb3115e35292ff91e25716133f4637c35ad79f30a45a85bfb06eaf33"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::perform (cognitive 55): Editor::perform has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 5 (12 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf7d9907253c71300bb3bb3ca5526bcffc35347de3f73b13b985b4bd4ba39a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ComboBox::update (cognitive 54): ComboBox::update has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (49 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 28). 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":"widget/src/combo_box.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"047102880fb3feb9c37b37bc9476bfe240dd2e9eefb067144aa4023597853177"}},{"ruleId":"D2","level":"warning","message":{"text":"State::update (cognitive 54): State::update has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 9, match/switch 3 (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":"widget/src/scrollable.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"d345d4c64babb36f54b81b754bf8acb641da6b6c122aeabb1a034b6988e1f4a6"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_beacon::run (cognitive 53): iced_beacon::run has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 7 (30 pts), if/else 5 (17 pts), loops 4 (6 pts) (nesting depth added 37). 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":"beacon/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a662c70d9f4d7880379a9ee4fdb8860be882fe3514bb2af70fa0d0f2c833ab5b"}},{"ruleId":"D2","level":"warning","message":{"text":"UserInterface::update (cognitive 53): UserInterface::update has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/user_interface.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"20878fc6db83d1c7e1ce922a5a8979626b215571004673f4c8b02b4ade3800e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Content::push_str (cognitive 50): Content::push_str has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 7, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/markdown.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"355dde1a02c7a0ea8e1cd1e8cb2bdb4f2ecfaf90cf7b5aab5ffd72ad3ef4115c"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::draw (cognitive 49): Renderer::draw has cognitive complexity 49 (threshold 15). Drivers by points: loops 8 (29 pts), if/else 6 (20 pts) (nesting depth added 35). 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":"tiny_skia/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea72e20107db015dee48ed4d80028606cacb44b7213e4f02c578d74096e1c796"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::layout (cognitive 47): Table::layout has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 3, boolean chains 2 (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":"widget/src/table.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7413d3923f932ef02ecbff98b38af79cda908a0a5029bc950f1e8df36f291cd"}},{"ruleId":"D2","level":"warning","message":{"text":"State::update (cognitive 45): State::update has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 6 (12 pts) (nesting depth added 23). Of this number, 40 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0bea86c213053ffc79ae82a215e39fccc0998c246e05a22f72e99106f206ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Sensor::update (cognitive 40): Sensor::update has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/sensor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"655746b89a67b4b746d4cd23d33d0a71616a6c4a7a90d61ad48cb768cd763c85"}},{"ruleId":"D2","level":"warning","message":{"text":"Tester::tick (cognitive 39): Tester::tick has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 22). 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":"tester/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25ea35bb3f6ca24994127f60d2fb239fba9763829a19276ce8cbe99124cc246"}},{"ruleId":"D2","level":"warning","message":{"text":"PickList::update (cognitive 39): PickList::update has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pick_list.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda00e239500098b87017c1d7455320cd575d385257dea36e66a28edfc81840c"}},{"ruleId":"D2","level":"warning","message":{"text":"Rich::draw (cognitive 39): Rich::draw has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (13 pts), boolean chains 4 (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":"widget/src/text/rich.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"53328a016e1642cb1e666b017ce213408ea2413722d2e7d68acd566c5135d32f"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_beacon::client::run (cognitive 38): iced_beacon::client::run has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 2 (11 pts), loops 3 (7 pts) (nesting depth added 28). 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":"beacon/src/client.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4da283524d726066adbe067f5047bf8867f57406a6bd011fb2fff85ea9c1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Binding::from_key_press (cognitive 38): Binding::from_key_press has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5aba8f3f6e04573930ff848bad04f71fb3204bb842edfae4bee43ef3384539"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewer::update (cognitive 38): Viewer::update has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/image/viewer.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"506b4a921204fffcf8ac9c552188885cfbb17743ec4b088ad7d53e337d641004"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render (cognitive 36): Renderer::render has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc268c154846939fad141956afdb173ffb3b2a2cd957d8e82f7d4cf468b9b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"VerticalSlider::update (cognitive 36): VerticalSlider::update has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (29 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/vertical_slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ebadeb81ec01e2779218417fee050269ff38b8f1f479ae539f45cc362a6720"}},{"ruleId":"D2","level":"warning","message":{"text":"Slider::update (cognitive 35): Slider::update has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (29 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"widget/src/slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e65851e4c22b41870ed8bc9c2e2c555ea16a48b91c277cfd9a26c34c63c9f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DevTools::update (cognitive 33): DevTools::update has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 6 (14 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"devtools/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6d410846a11c2191a9d020bbcb9238cac37222cd8726e410ea31799b7cbdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_winit::run (cognitive 32): iced_winit::run has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 7 (11 pts), boolean chains 1, loops 1 (nesting depth added 18). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: winit/src/lib.rs holds 4 of the 63 functions over the threshold \u2014 including the worst \u2014 and 434 of the 1495 points over it (29%), 2.8\u00D7 the next-largest file (widget/src/scrollable.rs at 157). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de3e4dba2fa5f6dfea07e640e052faf0a53ca3cd571ae4e286a8f08a60d644b"}},{"ruleId":"D2","level":"warning","message":{"text":"State::prepare (cognitive 31): State::prepare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (14 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaf917f1fdc356e93e07ed1e5bdfb44d35c27b1670442302dac614455ad40ec"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_widget::mouse_area::update (cognitive 31): iced_widget::mouse_area::update has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/mouse_area.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"222287ca62e13e85d628cfa6cb60fe256cb6b78d0f05ac1a9e8961ac6eed9c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrollable::layout (cognitive 26): Scrollable::layout has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/scrollable.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad4125b3280df100868f1b584a61f92dfeffa837e70afc2b0ec46b5d3bc3cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrollable::update (cognitive 26): Scrollable::update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/scrollable.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cfe009986e7cb2fa74114a7ab42f63e4113243b727d54e35b05d2130f1db21"}},{"ruleId":"D2","level":"warning","message":{"text":"Atlas::allocate (cognitive 25): Atlas::allocate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/atlas.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a1f2ad04dc73772ee64875a51f65525784da113379e183e039156538214a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Content::resolve_sections (cognitive 25): Content::resolve_sections has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/markdown.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"73590374a6b110c9064263afedfa1d4cbf708934be67e0c6e5f72e0ea384bba5"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrollable::draw (cognitive 25): Scrollable::draw has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, 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":"widget/src/scrollable.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce46d71bd26b9fdfec0ac31a5740fcc869d5b5bc8b57a137889872423e4e07"}},{"ruleId":"D2","level":"warning","message":{"text":"Geometry::cache (cognitive 24): Geometry::cache has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/geometry.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3377122e6e5dfa1e4fc2cdef55c471a6b850a7ee27ccd61875ccd49b6adb865"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_core::widget::tree::diff_children_custom_with_search (cognitive 23): iced_core::widget::tree::diff_children_custom_with_search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/tree.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed601d6db0532fb8f36848d5ee0bc449436943e27ab3e535616647ae78171885"}},{"ruleId":"D2","level":"warning","message":{"text":"List::update (cognitive 23): List::update has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/overlay/menu.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea9bef4b64af19ba34fc760d50d0f36676f255d87618c48b37d4bd06ebc3315"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_graphics::text::regions (cognitive 22): iced_graphics::text::regions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4018bb6b72af93092143d14a754aac63892957cc63c19f8d3203e276c465d109"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::update (cognitive 21): Editor::update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99f316b4fe3c20dacd7d4cc173fd284224654c81017ae868ef240cb43ee10ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Tester::controls (cognitive 21): Tester::controls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 6). 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":"tester/src/lib.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cffb48f27271e600dfcb999b2cf13d76c719d997d0bb1e634934ce521338be7"}},{"ruleId":"D2","level":"warning","message":{"text":"Button::update (cognitive 21): Button::update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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":"widget/src/button.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9447db1e0ecab27292b2ab520db86609d0db9d86fc6f099884c7afde1562c41"}},{"ruleId":"D2","level":"warning","message":{"text":"PaneGrid::draw (cognitive 21): PaneGrid::draw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"d871aab1daef9048c59484547e8fd69e9998834a58eba40770bf162f740dd7e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Transition::update (cognitive 21): Transition::update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3 (nesting depth added 10). 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":"widget/src/transition.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"916684ad5be9d75552b6911dfe1c4bc35292113c13b75e2f28f4b270174f7348"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::draw_quad (cognitive 20): Engine::draw_quad has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c460d6f4d12f8dddd42b0e157ca19a2a7d7728183dcad7f47057aa398153e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache::draw (cognitive 20): Cache::draw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (6 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":"tiny_skia/src/vector.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9a5a0203eb17c1e0b3cbe12ab67c288fdf0c0cef2fc0bccb834aa71fbe60c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Wrapping::layout (cognitive 20): Wrapping::layout has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (8 pts), match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1b2c51fd1b1f34c42a32648bbab1f8360112c6bf88248668048a938f83c340"}},{"ruleId":"D2","level":"warning","message":{"text":"Wrapping::layout (cognitive 20): Wrapping::layout has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (8 pts), match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/row.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c236a78244739adcd24ae50afbfd45582f247d2c31f419812311479e2e89bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Rich::update (cognitive 20): Rich::update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/text/rich.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cabfe343a4cb7c017485bc56b5d8e161f6166e75a1cc54f2087a3b6f631f958"}},{"ruleId":"D2","level":"warning","message":{"text":"GlyphCache::allocate (cognitive 19): GlyphCache::allocate has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d931740e0c98d5528e135a3bb5ef0071d3f1963a5ae2272a38ff18a22af20bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache::upload (cognitive 19): Cache::upload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 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":"wgpu/src/image/vector.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3fe74951ba77646c1b57dc66ddc983b617f878b55eacef604aed923793f4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_wgpu::text::prepare (cognitive 19): iced_wgpu::text::prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (6 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":"wgpu/src/text.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4418da5ed55f4567016f4486ed4ac98ad2bacafc7b517e44fc517b92670866b"}},{"ruleId":"D2","level":"warning","message":{"text":"Text::draw_with (cognitive 18): Text::draw_with has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), match/switch 3 (7 pts), if/else 2 (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":"graphics/src/geometry/text.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7933724c45bfb37b1fff66ae1d5eeb943811be05a7b2af6ad6d5357a932845c"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache::receive (cognitive 18): Cache::receive has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), match/switch 1 (2 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":"wgpu/src/image/cache.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea0dbc1f2887339759c0ede8e584afc41713e4ec75e177ea367d45e8a30dfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Instance::update (cognitive 18): Instance::update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, 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":"widget/src/component.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe821d3c8556d85b626423b82b5fb79845477221bc1cf56d16005ba58427259"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::update::apply (cognitive 17): Input::update::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/input.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5322bc96283d16f3bd23b2b5987e8d57ef8181106ab93dbbabbef812c1c5201d"}},{"ruleId":"D2","level":"warning","message":{"text":"TextInput::update (cognitive 17): TextInput::update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/text_input.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"28657c7766a83104e0029ed823fab0d771735108759ff674ec9afa48b23a79d1"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_winit::update (cognitive 17): iced_winit::update has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), match/switch 1 (5 pts), if/else 1 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: winit/src/lib.rs holds 4 of the 63 functions over the threshold \u2014 including the worst \u2014 and 434 of the 1495 points over it (29%), 2.8\u00D7 the next-largest file (widget/src/scrollable.rs at 157). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7e5134283abaa313816dbd0773b3ef7c162a6c39e9c7361b63f59cd020e53a"}},{"ruleId":"D2","level":"warning","message":{"text":"Limits::width (cognitive 16): Limits::width has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Limits::height) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/layout/limits.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"877cd45171883c3f76aa801ded61b0b2fba1bfe063f9a5d974be1116c73c6371"}},{"ruleId":"D2","level":"warning","message":{"text":"Limits::height (cognitive 16): Limits::height has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Limits::width) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/layout/limits.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff44dadd521c1e37cfa6be691354899f4d84800a1fa280cc9ea2ec2e40094039"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::draw_text (cognitive 16): Engine::draw_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4705e77df70605f6a3bf23e11b6441bee93109f0e0e141949c249f4a719dcb02"}},{"ruleId":"D2","level":"warning","message":{"text":"iced_tiny_skia::geometry::convert_path (cognitive 16): iced_tiny_skia::geometry::convert_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), 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":"tiny_skia/src/geometry.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"639096268cdb54dc7f67ca5e5cf804a84568fb97b3dc3c4139c1f8a90ceb0601"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::prepare (cognitive 16): Renderer::prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"571dd70796b1be1a11b6e6be6b3c0f02a851dde5c29d314e2c2602013a25b6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"TitleBar::is_over_pick_area (cognitive 16): TitleBar::is_over_pick_area has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (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":"widget/src/pane_grid/title_bar.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bc1d59b28f7daf85b00a6bd49b5863dab6d3626ca6023a9217844ce73aacef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_winit::run_instance: FunctionTooLong \u2014 iced_winit::run_instance runs 500 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 400 over it, 5.00\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":"winit/src/lib.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d3ecadce72c38631aa5d3f1efe440405556c5b8d88ed74c948b3e27d6284d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scrollable.rs: FileTooLong \u2014 1983 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 1483 over it, 3.97\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":"widget/src/scrollable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ef6218e140b5fa5d8693f91a4f73aed841990c7a9ae315015f2e2d68a7ad69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_winit::conversion::key: FunctionTooLong \u2014 iced_winit::conversion::key runs 314 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 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/conversion.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"32eb82206ab1c26d9fabd15a3946e60872bff26247f071e97067cc981a54d0e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/markdown.rs: FileTooLong \u2014 1354 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 854 over it, 2.71\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":"widget/src/markdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66437e142e57f81e6322d88ff8f2902489c77d66b9f15574cb3f60a8cb8d530d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1264 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 764 over it, 2.53\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":"winit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1ad14c8f95283d4ab932547a7232d4e896484a926a2b1f950e9442ee986332"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_core::layout::flex::resolve: FunctionTooLong \u2014 iced_core::layout::flex::resolve runs 252 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 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/layout/flex.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb73c1ad3c65bdb0bc2e0759999ed128b44674a79f85ea6016c774820eaea41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_winit::run: FunctionTooLong \u2014 iced_winit::run runs 231 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 131 over it, 2.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":"winit/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbac3201f9dbfcb3ae204e80ec96803c766d37e6e8d7e249ae9fd53fc832374c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_winit::conversion::key_code: FunctionTooLong \u2014 iced_winit::conversion::key_code runs 198 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 98 over it, 1.98\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":"winit/src/conversion.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"80284587454c81d8f65eecd7c696c164661e9bab3204fdfed1c7fc2f504a63f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: State: ClassTooLong \u2014 780 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), 29 methods, 4 blocks, lines 1227-3134. The bar is 400 significant lines; this is 380 over it, 1.95\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":"widget/src/scrollable.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0639a3ee81d965455abf22c14f5fc8c46b282013c73b1a4a78b4d8b8c94d33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.update: MethodTooLong \u2014 update runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1592ffa39cdfd42ab9d51ddd39b16cb3f784f6be50afd27652c507ea3e1be9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UserInterface.update: MethodTooLong \u2014 update runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/user_interface.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4947afff3ba296f1e78d42be155872ba0974738550b8736e183cbf28326db74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.interact: MethodTooLong \u2014 interact runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/scrollable.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f363de2061f70fde732c66148d01bf8153ed11a1b27cc6e171c1739ba960d185"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.draw_quad: MethodTooLong \u2014 draw_quad runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67aae205ebc144b503b7e1555b0f490467b2d373bacde1f1b66480742b22a10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conversion.rs: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 382 over it, 1.76\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":"winit/src/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b52fa5f013a71d980b4f41ea2a4468702a9003409fb2dd0d6d26f15a63bab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render: MethodTooLong \u2014 render runs 175 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 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da38d7ead75d41856845bb73aa90fad96c7215c2be75be2e425d92ef4589f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Editor.perform: MethodTooLong \u2014 perform runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a719a32d92a9bb1cf36b4a4a3aeeabb914ea674fc2d41ab0d88093aa81270d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: iced_widget::helpers: TooManyFunctions \u2014 52 free functions. The bar is 30 free functions; this is 22 over it, 1.73\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":"widget/src/helpers.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eefa640cb3cf3ee763863638b3059c1939734536741f0690aa1af70c9ad3af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_wgpu::text::prepare: FunctionTooLong \u2014 iced_wgpu::text::prepare runs 164 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 64 over it, 1.64\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":"wgpu/src/text.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cbf48d5073b74390b21b3139add51bd8d674113ddea074c9ebe562d2f81c9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pane_grid.rs: FileTooLong \u2014 767 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 67% of them inside a single declaration: PaneGrid (4 blocks, 148-927). The bar is 500 significant lines; this is 267 over it, 1.53\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":"widget/src/pane_grid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfe449b6c0b9b7098389e277e1989f01f5a5abee68784a8183212e40ee029c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaneGrid.update: MethodTooLong \u2014 update runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ae5cbddd851dd1413af971435f50bbe99efbd57d22ef42dfe769449657f221"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Renderer: ClassTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 12 blocks, lines 73-966. The bar is 400 significant lines; this is 184 over it, 1.46\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":"wgpu/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff920583ac5338a4df842ea3059e5cbe8730343cae6985948975e5f2fd09c9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Table.layout: MethodTooLong \u2014 layout runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/table.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c5e661ca031da0e2cbc931d55759b0df4300d810f8183dee86ec1622740608"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: iced_runtime::window: TooManyFunctions \u2014 41 free functions. The bar is 30 free functions; this is 11 over it, 1.37\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":"runtime/src/window.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dea08c097768b6794138744f80ad063a66adc09fc7a952880fa5a8fe74d22c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_wgpu::color::convert: FunctionTooLong \u2014 iced_wgpu::color::convert runs 134 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 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/color.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba9969459c7af87a59737cbef5c7f299e36ef57e01855c3ec6140dfeab1de7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Content.push_str: MethodTooLong \u2014 push_str runs 134 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 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/markdown.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051e5a29bbe73b9050c371cf884a26c7293101afacf6979f7f252094b5534af"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PaneGrid: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 4 blocks, lines 148-927. The bar is 400 significant lines; this is 116 over it, 1.29\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":"widget/src/pane_grid.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29216bb0fc362e57e20f65bdb595edce7d564adf1ab53aeae1f46e7cf8c5da7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tester.controls: MethodTooLong \u2014 controls runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/lib.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d640131b05e52e012fe90ee9187d81d496a82246dd365292901f6b9919dd366"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/editor.rs: FileTooLong \u2014 628 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 78% of them inside a single declaration: Editor (3 blocks, 31-850). The bar is 500 significant lines; this is 128 over it, 1.26\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":"graphics/src/text/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7763354f7b27e467714508b943f43c488f75eb348841772ccb5fbcff6cea8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: Renderer (12 blocks, 73-966). The bar is 500 significant lines; this is 124 over it, 1.25\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":"wgpu/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8339b4d57d431ef92bbc939396899792a49d0a77cf6dccf4788d4c2572edbde7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 621 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 71% of them inside a single declaration: Tester (2 blocks, 108-792). The bar is 500 significant lines; this is 121 over it, 1.24\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":"tester/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804ab5691cb588e8220cf0e266ae065a5a195d2eb811185f060ca382079f38df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/triangle.rs: FileTooLong \u2014 615 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 115 over it, 1.23\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":"wgpu/src/triangle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2719f36def0f2bc0a1cb445f8b67c9d99c5d70000eb2e40360bea5357cf3cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/editor.rs: FileTooLong \u2014 612 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 112 over it, 1.22\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":"core/src/text/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d14e770fe2ac20ef7f2a9a7df83379b09de52780a376a036a0f8c9d3953452"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Editor: ClassTooLong \u2014 488 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), 5 methods, 3 blocks, lines 31-850. The bar is 400 significant lines; this is 88 over it, 1.22\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":"graphics/src/text/editor.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e6bdd3e53540431f6f4d8acde83d304c039acd55cc308080b8ececabe6336b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scrollable: ClassTooLong \u2014 476 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), 21 methods, 3 blocks, lines 83-1014. The bar is 400 significant lines; this is 76 over it, 1.19\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":"widget/src/scrollable.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e65e75c9d3dc60fa6bcde8f91b0e209c34087e73ca6cc6a9ba3346019c89c60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tester.update: MethodTooLong \u2014 update runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bbce75b1ba0862064de5536b2fdefdc98924d5209c1c20653ec6f11c167c04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.draw_text: MethodTooLong \u2014 draw_text runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d8320f76090e2e30a6fec9ba6f28e13df106145980771e127d1729502430b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaneGrid.draw: MethodTooLong \u2014 draw runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3740a4872c419c27bf16796a1733299ca42ce8483344f694a435f557b4dec275"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compositor.request: MethodTooLong \u2014 request 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":"wgpu/src/window/compositor.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2955a8fc0933f695bd2ddc7ea2a0e02f5e35068edccc11a39849f864cee720b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: Engine (2 blocks, 8-604). The bar is 500 significant lines; this is 60 over it, 1.12\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":"tiny_skia/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bc5d1c754fd59af7ba1ee9a3c8175e29b4e7c5cd59cd7c963d27817fe2dc7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Input.update: MethodTooLong \u2014 update runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/input.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb4ee2e561ffb7458583a727bf40b0032cbccd06d252130fd4e5481a05e3d99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Slider.update: MethodTooLong \u2014 update 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":"widget/src/slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3997964aab36a67e60a6b8837e5b7c3998a96a76ac4ca7d0cc1d860682bb13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VerticalSlider.update: MethodTooLong \u2014 update 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":"widget/src/vertical_slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d8fa498bf7b5736b3ad7f3338db58ec8d7bc2ea48839a8842a9e11fca3de20"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tester: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 2 blocks, lines 108-792. The bar is 400 significant lines; this is 39 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cad4a4e28894bfdf64d71cb736a6562475aa8f47c65939ef564b0978817441"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pick_list.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: PickList (4 blocks, 146-766). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pick_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfee2fca7f7507e9df1cd33423bb56683138c43c81d7b023743760b1515cb82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iced_winit::conversion::window_event: FunctionTooLong \u2014 iced_winit::conversion::window_event runs 108 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 8 over it, 1.08\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":"winit/src/conversion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8678513599cc84b04e2446fc8d38dc35ed3dd67befff08e2e1da6f4370663f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PickList: ClassTooLong \u2014 430 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), 18 methods, 4 blocks, lines 146-766. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pick_list.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb63846cdbf573acd7467f3cb91dfcd0f3c4bd9ed723c7a45f60defec266143"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Engine: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 2 blocks, lines 8-604. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"424a3b3ca77c0f9e9a04c3c8820fc779492a185d53a37a04bb98cb7ce565981c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.update: MethodTooLong \u2014 update runs 107 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 7 over it, 1.07\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":"widget/src/scrollable.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0824b38ee9f4315889e37b8929ee5594a8ad2490a3b863ae1fcbe14e31c49cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/application.rs: FileTooLong \u2014 526 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 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"423d73e84296137ea43334a2f8570353b2b86398ab47f0d00781694724bcb1de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComboBox.update: MethodTooLong \u2014 update runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/combo_box.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"383c8e86b9ee46a5168b9401ebec6c52c2f3bfd43f995723810fe03de67b3004"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scrollbars.new: MethodTooLong \u2014 new runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/scrollable.rs"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7a6a3e7250e92c22c072245aa9812801674043284d67d12fa5dcb3832dcadf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pipeline.new: MethodTooLong \u2014 new runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e574cc1be1c4f559760ed64fdc95e227eda27dfade0b2f4cc1a2e9b2b55bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (126 shared lines): widget/src/slider.rs:254-414 | widget/src/vertical_slider.rs:254-411 \u2014 These two members are variants of one another: 126 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aefca3810f1d7b5045464ea7bc1d1fc2057fd2314d28c85fa837e363f3426e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): src/application.rs:92-166 | src/daemon.rs:36-109 \u2014 These two members are variants of one another: 38 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d536ad2216c04d6e4aad2f59cb25f841f2ea4127865d32ca0f37ffc91ea9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): program/src/lib.rs:114-194 | program/src/lib.rs:200-277 | program/src/lib.rs:282-364 | src/application.rs:704-782 | src/application.rs:788-865 | src/application.rs:871-952 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"program/src/lib.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf4d93a681e46c958423b0c21753fc3c4eb6da0701e48621cc332be54926428"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): widget/src/column.rs:223-233 | widget/src/grid.rs:239-249 | widget/src/keyed/column.rs:256-266 | widget/src/row.rs:229-239 | widget/src/stack.rs:180-190 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacda7a73a0ecf11f6d21cbef40d836c3f782f52bd6c75c94152c94e21455e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): wgpu/src/image/mod.rs:38-177 | wgpu/src/quad/gradient.rs:72-170 | wgpu/src/quad/solid.rs:64-144 | wgpu/src/triangle/msaa.rs:23-118 \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":"wgpu/src/image/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a964d91a8dc3cedf342d0b831d52a332348b7a56d98f19ada14d94ba174ec25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): widget/src/column.rs:261-270 | widget/src/grid.rs:277-286 | widget/src/keyed/column.rs:294-303 | widget/src/row.rs:267-276 \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":"widget/src/column.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78020ac29d10ca60df53f97c7c42f63171beb000a84b46b9652c3a5138e3da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): widget/src/pane_grid/title_bar.rs:322-360 | widget/src/pane_grid/title_bar.rs:371-428 | widget/src/pane_grid/title_bar.rs:437-477 | widget/src/pane_grid/title_bar.rs:487-541 \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":"widget/src/pane_grid/title_bar.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0adb8239c9fcef64893366c6991973ab38091a998f89b4fc511fc13b1f0763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (105 corresponding lines): widget/src/column.rs:362-467 | widget/src/row.rs:367-471 \u2014 These two members are one piece of code written twice and then edited apart: 105 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":"widget/src/column.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9058f16eea5ffa1e02fd20bf62660df32472cffc38cc22c23356a87150db51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): widget/src/slider.rs:425-498 | widget/src/vertical_slider.rs:422-495 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"32042a996cc70b5029dee1c003da13f17b906c8e60dd2c9552ee5ce285accd83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): core/src/layout/limits.rs:63-123 | core/src/layout/limits.rs:126-186 \u2014 These two members are one piece of code written twice and then edited apart: 61 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":"core/src/layout/limits.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a392b7797774b474161694ca225f2f7b67b5f7bd8153be314d21a7dd319e24d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): wgpu/src/triangle.rs:683-742 | wgpu/src/triangle.rs:815-886 \u2014 These two members are one piece of code written twice and then edited apart: 60 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":"wgpu/src/triangle.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e2c0161ce8326c7052ad6dc21b67ea817f540912e07981e8e9ff3846d884bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): tiny_skia/src/geometry.rs:159-216 | wgpu/src/geometry.rs:272-322 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"tiny_skia/src/geometry.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75a2c26f00af4d9246f708fe44b2f0d5c8af1d7138a48c2a973d1ed20e64d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): futures/src/subscription.rs:303-348 | futures/src/subscription.rs:359-411 \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":"futures/src/subscription.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"400e278cca27845b41eb4513147ed7aee837fbea5188f20d38e792bb696513a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): graphics/src/gradient.rs:94-123 | graphics/src/gradient.rs:138-174 \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":"graphics/src/gradient.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5936e4a57aa7cf33ddf803df2195d62da7d0536fbca694ae19148cfba00b6c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): tiny_skia/src/vector.rs:89-124 | wgpu/src/image/vector.rs:51-91 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"tiny_skia/src/vector.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e5709b24fa22567d5bd90ba804bf2dd294fc8602767e47cd94bed5ce9f27ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): widget/src/text_editor.rs:796-834 | widget/src/text_input.rs:580-618 \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":"widget/src/text_editor.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed79e7f52b366719a621f2b46d71fc398ca64df4ade31a01db65cb957e5efae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): widget/src/pane_grid/node.rs:260-295 | widget/src/pane_grid/node.rs:304-343 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"widget/src/pane_grid/node.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bcc4e552807afdd90c510108ce9738ad973ed26c668c00f6fa911d1b3a2ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): widget/src/checkbox.rs:282-320 | widget/src/toggler.rs:259-306 \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":"widget/src/checkbox.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2854b93f2650ebfb2c05ebe05f1ea1ad27770235736378f102a8007b611d62ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): winit/src/clipboard.rs:52-92 | winit/src/clipboard.rs:99-135 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"winit/src/clipboard.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"018ff33453178f6bf6d8582eccd0172160096232888592a2582692407141e937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): core/src/widget/operation/focusable.rs:107-137 | core/src/widget/operation/focusable.rs:145-169 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/focusable.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0f1d63087bd4034f636a9eb736b1e00f73093bff8802d2899a0702fbf62fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): widget/src/scrollable.rs:2478-2512 | widget/src/scrollable.rs:2522-2556 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"widget/src/scrollable.rs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8b97faa5567b9553fba8672f07ed4ddbc8dae51ef12487b3d51539904ad60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): widget/src/checkbox.rs:331-367 | widget/src/radio.rs:327-358 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/checkbox.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd73b42aab4ffd79ca0ded7bdd9ba7760467dfb3b255b7ac831db9fbe4ea9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): wgpu/src/geometry.rs:170-198 | wgpu/src/geometry.rs:231-263 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/geometry.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"42361df4067fa646d86a7e8efb7f13cb18c3a99afd267ddb4895ce48702640f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/application.rs:189-217 | src/daemon.rs:131-152 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c812e6257526faf2e135955e91f5f50e77b8a71eb979a6692fc5a7df3a67980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): widget/src/image/viewer.rs:121-146 | widget/src/svg.rs:167-194 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/image/viewer.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0994f58c4830a3e5b27e3109f0ddf507e70d8573763ecac1b67e59cc14530a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): core/src/widget/operation/scrollable.rs:42-73 | core/src/widget/operation/scrollable.rs:81-112 | core/src/widget/operation/scrollable.rs:116-147 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/scrollable.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff922d21d6e4b55d2e7d9c9fb5290fd1bdc43b468b348ab27afcbed720ce55d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): widget/src/pane_grid/content.rs:203-224 | widget/src/pane_grid/content.rs:236-268 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/content.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ea0620201d024f10fc7f5538eb72bcaf3e8a3b328c5627193224c0044e273f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): core/src/length.rs:131-155 | core/src/length.rs:158-182 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/length.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3fe1c5498d31ba6777f0424fca38c99202d81fda92f0e57658e7d5a9c3288f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 27\u002B corresponding lines): widget/src/checkbox.rs:587-613 | widget/src/checkbox.rs:616-642 | widget/src/checkbox.rs:645-671 | widget/src/checkbox.rs:674-700 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 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":"widget/src/checkbox.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"390f080a942c9eb2d81b584b42609c09ea140171a54e3c91ff051480b64ec9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tiny_skia/src/layer.rs:78-95 | wgpu/src/layer.rs:107-124 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0885f61b47f1277a507b075dea0f7e2030f71f5ef78d60eca643dc8133edcf67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): tiny_skia/src/lib.rs:307-335 | wgpu/src/lib.rs:845-878 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17e6ffb0e059df6898b8fe6f32290f5a13f331b287fe47a6177e6a347ed12e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): widget/src/combo_box.rs:653-682 | widget/src/text_input.rs:407-431 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/combo_box.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77bd7f5ef411a0ae78859e3dea653a0fd5e48f429caaf37ea70b0271b64f792"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/src/gradient.rs:66-81 | graphics/src/gradient.rs:65-80 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/gradient.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6e10706f9e938db506a1be7805aad52e10bf940348ac3ddc07421727c1e5df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): widget/src/pane_grid.rs:444-460 | widget/src/pane_grid.rs:685-714 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67eff77e0d6010b020bdf729dc0e30e4f9e6f60adf434dae9ecec2e5b09243d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 22\u002B corresponding lines): core/src/widget/operation/focusable.rs:29-52 | core/src/widget/operation/text_input.rs:32-53 | core/src/widget/operation/text_input.rs:57-78 | core/src/widget/operation/text_input.rs:82-104 | core/src/widget/operation/text_input.rs:107-128 | core/src/widget/operation/text_input.rs:135-158 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/focusable.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aacda23027523c3fcf458a5dedde0843f66e6f54030ea5051443e8d97cd3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): widget/src/slider.rs:125-151 | widget/src/vertical_slider.rs:124-150 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"widget/src/slider.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c932afa2e3f9b5630bcdd056705fb19d3e97362f34d26c80be6c2ad39057e91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/src/rectangle.rs:195-215 | core/src/rectangle.rs:223-239 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/rectangle.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"454eb2eee38eaf0f646948ac4789632c694c2c7c08e942497c4c32f5c91fdbaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): widget/src/popover.rs:216-230 | widget/src/tooltip.rs:127-145 \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":"widget/src/popover.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65703af9fc5f01f7ece6079264bc02e1936f05a0b45a67c003b5fe89e378e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): futures/src/backend/native/tokio.rs:38-55 | futures/src/backend/wasm/wasm_bindgen.rs:27-42 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/backend/native/tokio.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a698368700eec20b0dce79013002dabf3ba36bb7fd52d619c22575e7919c077"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): tiny_skia/src/geometry.rs:98-113 | tiny_skia/src/geometry.rs:115-135 | tiny_skia/src/geometry.rs:137-153 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/geometry.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc93a875afa3ab6c549ccc9276dbb35449436bd5e68124247737249fbab75497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/src/length.rs:55-63 | core/src/length.rs:65-73 \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":"core/src/length.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b49d8f9990610a7274d4ca1e2be7272aa2154fee0ebef1c987e008c9940218e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): wgpu/src/triangle.rs:634-656 | wgpu/src/triangle.rs:766-788 \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":"wgpu/src/triangle.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41eacfe9d415604cb4e71afb186eaef37cfa530ad7a180c2b573fcf0a6e6927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): tester/src/recorder.rs:141-167 | tester/src/recorder.rs:248-264 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/recorder.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d5c51622a315ddf338963646bcfd9330e69b0a36458b09c31ba061bdf69cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): futures/src/backend/native/smol.rs:49-62 | futures/src/backend/native/tokio.rs:63-76 \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":"futures/src/backend/native/smol.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155971c84543397b7aa2866a0deb00dfc2264e5c9f4d23e16bb367638e06bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): core/src/widget/operation/text.rs:97-116 | core/src/widget/operation/text.rs:119-138 \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":"core/src/widget/operation/text.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7381ed4001a069f8c07469008f3b45558c093a16e71a18efef1a7cb13e250833"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): widget/src/column.rs:198-214 | widget/src/keyed/column.rs:231-247 | widget/src/row.rs:204-220 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"03db34475780eb7557a27c932cab4d0b6b554675c2bb1461c8e182c64c5077a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): core/src/text.rs:502-520 | core/src/text.rs:528-546 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"248c8a0b4c1d3fb7b6915a08e79fbef27f9ea825cfb3fe75b4d4846428e2b8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 13\u002B corresponding lines): widget/src/button.rs:578-590 | widget/src/button.rs:593-605 | widget/src/button.rs:608-620 | widget/src/button.rs:623-635 | widget/src/button.rs:638-650 | widget/src/button.rs:672-688 | widget/src/button.rs:691-707 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/button.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"182861e236d2e2f261bb9ea0e31de563d0d4dfc461c493e2dec088263da393f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): runtime/src/clipboard.rs:39-53 | runtime/src/clipboard.rs:56-70 | runtime/src/clipboard.rs:73-87 | runtime/src/clipboard.rs:91-105 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/clipboard.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85e88054048df84cf8aefd3ee5a42e5cbb11e3c838f8e90e912747a1fcdb15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): wgpu/src/triangle.rs:662-675 | wgpu/src/triangle.rs:794-807 \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":"wgpu/src/triangle.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67a06d25929d8e3e04ed0b7e132a4037bb71d8d8e5ddbdfd7b9b4f12e9121cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): runtime/src/task.rs:417-432 | runtime/src/task.rs:439-451 \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":"runtime/src/task.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8190129931f7da9d80676fff64eb4904efffbaaf595488b4489320cd8f0a1366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): widget/src/pane_grid/node.rs:113-131 | widget/src/pane_grid/node.rs:141-159 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/node.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70af7d5aa6089373872656df61b1a64eb7b06ef1709b9ae78074b07e107a4ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): wgpu/src/quad/gradient.rs:179-188 | wgpu/src/quad/solid.rs:152-158 \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":"wgpu/src/quad/gradient.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e556d17e67e67ee275ca283b3993c00a5c354bbdfedad3bbcd5d4052b9cec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): widget/src/column.rs:178-189 | widget/src/row.rs:184-195 | widget/src/stack.rs:123-132 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9af58f08076aa8f14eaae1455431f5738ba0e8b680b73285077c512ec724cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): highlighter/src/lib.rs:33-46 | highlighter/src/lib.rs:164-178 \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":"highlighter/src/lib.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e0c7ae3351b96a5bd6655fda089b30d08b1def2d1513f0ddcc946df042d272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): widget/src/button.rs:230-236 | widget/src/container.rs:210-216 \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":"widget/src/button.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a632a6661eb235340a2c05c1591c4b5bbd1209bb686f13340fef88eac8970b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): widget/src/stack.rs:239-249 | widget/src/table.rs:535-544 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/stack.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75991269f2985f452fc27579ea4effbd2cdf5c5707ec5a225a339f8af351d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): widget/src/text_editor.rs:601-610 | widget/src/text_input.rs:321-326 \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":"widget/src/text_editor.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6aa6f71d79585f57247884a8d3723057810136d5d19ddb5f7fd0a94d54a665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): tiny_skia/src/layer.rs:342-360 | wgpu/src/layer.rs:308-330 | wgpu/src/layer.rs:332-354 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4937648f8b9a6b42ecd9e4b6ed0458d9b2b42875b9169d5a6982eb066fbdc65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/src/widget.rs:361-376 | core/src/overlay/element.rs:69-77 \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":"core/src/widget.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"134c6dd1fe24680faf6796975044d566cba6577970d6a8d8ee975cccfac82d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): selector/src/find.rs:151-165 | selector/src/find.rs:225-238 \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":"selector/src/find.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"27505afa7aaa80e79a16c9350eab87c0900e72e5d6fccb09477e15e733e6e0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tiny_skia/src/geometry.rs:284-296 | wgpu/src/geometry.rs:401-413 \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":"tiny_skia/src/geometry.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d13a300f66fed4e7bb3a9ad6b6e2bdeeaa8b705c831f88236a395bd06b5261"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): widget/src/sticky.rs:401-415 | widget/src/tooltip.rs:451-467 \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":"widget/src/sticky.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4541c85e8bf61a4031a5195a1bac4713d61fca7b26d06f2e096a1ebbf74b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): widget/src/button.rs:245-258 | widget/src/container.rs:225-239 \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":"widget/src/button.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97a3da01da7a8e94ff1972aef72e5043eb7bafa5b5aa960c7161bf9fdcd58e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): wgpu/src/quad/gradient.rs:32-44 | wgpu/src/quad/solid.rs:26-38 \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":"wgpu/src/quad/gradient.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8948954cd3bc4e209dcea41418e892a457924963ccce89512eb1584ddd73625a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): widget/src/checkbox.rs:376-382 | widget/src/toggler.rs:366-376 \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":"widget/src/checkbox.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ee68f6c88882296f791403e5ce8016d9d56c1f0f1293ec7683b4f14d5b952f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tiny_skia/src/layer.rs:40-50 | wgpu/src/layer.rs:69-79 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"420dc3727b80d3f365d0b3901c1bdc3b6a632e84994d0073098edacfd643b481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tiny_skia/src/layer.rs:59-69 | wgpu/src/layer.rs:88-98 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"435d7f4624442489248883588c7721f2be680680c86346b8899876cc35dc452b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/application.rs:454-461 | src/daemon.rs:276-282 \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":"src/application.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"348bc67b0324914021de5d84b0567faadaf19354f7aa023697b2139043821e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tiny_skia/src/lib.rs:206-209 | wgpu/src/lib.rs:681-684 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ccbee3a914b958844cc99008bdec99e09ee98b225c8312aeaede356e7b55dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tiny_skia/src/lib.rs:274-277 | wgpu/src/lib.rs:755-758 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfd05d540b292cf43cca4e2fa9e01866d6d103e959154cebd3a60dfd737e9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tiny_skia/src/lib.rs:285-288 | wgpu/src/lib.rs:766-769 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f8023781f315f88ede5e91a43d84507568cc0b31d73fa6b08b10e46a591eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): widget/src/button.rs:493-501 | widget/src/container.rs:412-420 \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":"widget/src/button.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c774cf0eb435bbf25caa5c3c81c27ee449f774eddb13d023f7edf84efad3a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tiny_skia/src/lib.rs:363-366 | wgpu/src/lib.rs:796-799 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20dd666a86722f77e082e21e95accfb288c0b8ad0209d4c14d4b5e0095a2808"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tiny_skia/src/lib.rs:375-378 | wgpu/src/lib.rs:808-811 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12be0d7ce49301d9564ca5a384a1f81feba25f09c5e8f6065287e7a47213958"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): widget/src/combo_box.rs:297-300 | widget/src/pick_list.rs:301-304 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/combo_box.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6352f178f58fad9b66d1f604590068a8c3731bdb16825428551f03ff9d5a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): widget/src/pane_grid/content.rs:57-60 | widget/src/pane_grid/title_bar.rs:74-77 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/content.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"233dbc10e72d9414a93a36a7463ab3ff40747a794326034f0b081ff5164d15d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/application.rs:400-407 | src/daemon.rs:220-226 \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":"src/application.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e8b1b226b48edb742191f4117716af162682df09191753c66ad69be7b6bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/application.rs:426-433 | src/daemon.rs:247-253 \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":"src/application.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9291c84d6192cafe3a1ab71f98f8f73ec577c595d22d3f120a4bfc468f09d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): wgpu/src/quad.rs:313-319 | wgpu/src/triangle.rs:555-561 \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":"wgpu/src/quad.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2877a31f082e557411baf30d826342f0ae9cb615ddb8f76f7b1859e7936a6fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): widget/src/slider.rs:279-326 | widget/src/vertical_slider.rs:279-326 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:279\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":"widget/src/slider.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba102f5f9e5b2956fb69774954d71f4fa183f37daaa7564abff2f1bea15d5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): widget/src/slider.rs:370-396 | widget/src/vertical_slider.rs:370-396 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:370\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060widget/src/slider.rs:399\u0060 calls \u0060update\u0060 and \u0060widget/src/vertical_slider.rs:398\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0474771373cf5fa8d50bfb22b3f9b3e3e6002926cd1712ad1ba8cfdae898513b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): core/src/text/editor.rs:389-414 | core/src/text/editor.rs:455-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec46b2994982482a8f38838370c866bff95709257124693f578914b21dca8ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): graphics/src/text/paragraph.rs:77-101 | graphics/src/text/paragraph.rs:137-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/paragraph.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be9c6b5f58fb51b7a8125445e743be35e2acc408a60e2608bebac779627d9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): tiny_skia/src/vector.rs:161-183 | wgpu/src/image/vector.rs:134-156 \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 \u0060tiny_skia/src/vector.rs:161\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 \u0060handle\u0060 to \u0060\u0026Handle\u0060 in one and \u0060\u0026svg::Handle\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":"tiny_skia/src/vector.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"36beb08321abf6b5943c922d4165d1258b59d15ed3ee949d507499b1fbed5327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): program/src/lib.rs:232-253 | src/application.rs:820-841 \u2014 before extracting anything, compare \u0060program/src/lib.rs\u0060 and \u0060src/application.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060program/src/lib.rs:232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"program/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d11ef9aa4988ab28be10fc5f1a54327be3ff798982aa5d4e293be2c6c73f6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 6): program/src/lib.rs:135-155 | program/src/lib.rs:221-241 | program/src/lib.rs:305-325 | src/application.rs:726-746 | src/application.rs:809-829 | src/application.rs:893-913 \u2014 before extracting anything, compare \u0060program/src/lib.rs\u0060 and \u0060src/application.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060program/src/lib.rs:242\u0060 calls \u0060title\u0060 and \u0060program/src/lib.rs:156\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"program/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"42533b24a0969c34ad6932e3c1dea9b82840a672308dbb5f9a47fdfd3fa615f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): core/src/layout/flex.rs:350-370 | core/src/layout/flex.rs:413-432 \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":"core/src/layout/flex.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29892bbf2672cee0e9c491ead41063b6e29ce57c0f419611679063c6d03ae94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): widget/src/scrollable.rs:3599-3619 | widget/src/scrollable.rs:3628-3648 \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 \u0060widget/src/scrollable.rs:3599\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":"widget/src/scrollable.rs"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b393d7830a893c89b565ab6b3754249a5e0a2d57c3c4ac7c74da63ea392155c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): tiny_skia/src/engine.rs:141-160 | tiny_skia/src/geometry.rs:401-420 \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 \u0060tiny_skia/src/engine.rs:141\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":"tiny_skia/src/engine.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"941f7883525b103eb1e83f48fe0ede00f42828dc7b2bad80fa40213a5a146380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): widget/src/slider.rs:508-527 | widget/src/vertical_slider.rs:505-524 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1344bcf912b8d2928140107b2b0420c60073729c0afdf934d0365df17bd96c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): widget/src/checkbox.rs:452-469 | widget/src/toggler.rs:399-417 \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 \u0060widget/src/checkbox.rs:452\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":"widget/src/checkbox.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c8a8499385fd30b250bcba160f4040d15d95eebdfb6c74ebbbca37f7133c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): widget/src/pane_grid/node.rs:265-283 | widget/src/pane_grid/node.rs:313-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/pane_grid/node.rs:265\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":"widget/src/pane_grid/node.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9bdcaedabeb41f4c0d5f61404adabab93e06c7819176bf590853bb65e08d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): winit/src/lib.rs:846-864 | winit/src/lib.rs:1170-1188 \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 \u0060winit/src/lib.rs:846\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":"winit/src/lib.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc4e4a4a5964017ea3dfa5e46d000c7e0b2777b3bd88fc9ec1452910c8769a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): graphics/src/text/paragraph.rs:112-128 | graphics/src/text/paragraph.rs:199-216 \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 \u0060graphics/src/text/paragraph.rs:112\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":"graphics/src/text/paragraph.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"91966c2f39116353652f76129ab31fdcee0a6e784d3764a02f9c01d7e0bb1b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/application.rs:93-110 | src/daemon.rs:37-54 \u2014 before extracting anything, compare \u0060src/application.rs\u0060 and \u0060src/daemon.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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":"src/application.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a52bc6f0863e54958d161c7fd97eda2d15e989b212977bc6708b8029195f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): wgpu/src/geometry.rs:455-472 | wgpu/src/geometry.rs:478-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/geometry.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acadeb9b6bc31bb1cf8c68e802a2990fd057cd6ac530e1e3372c3689f9f16cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): wgpu/src/lib.rs:488-505 | wgpu/src/lib.rs:576-593 \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 \u0060wgpu/src/lib.rs:488\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, \u0060wgpu/src/lib.rs:595\u0060 calls \u0060finish\u0060 and \u0060wgpu/src/lib.rs:507\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":"wgpu/src/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"17abb34fc8eec045cd689e71d90bf19017be5f4865133edad50e73f539ef7e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): core/src/widget/operation.rs:184-200 | core/src/widget/operation.rs:306-322 | core/src/widget/operation.rs:385-401 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/widget/operation.rs:184\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":"core/src/widget/operation.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b918c8350422a1cc4f2201adf5f3c4dd61e38aa2e4b2615c5b5268f4ba740c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): winit/src/lib.rs:718-734 | winit/src/lib.rs:845-861 | winit/src/lib.rs:1169-1185 \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":"winit/src/lib.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a63a5445c33d7b9835a53e28a7868b0cdf4d985eb6e771175d1a013ce017a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tiny_skia/src/layer.rs:127-143 | wgpu/src/layer.rs:136-152 \u2014 before extracting anything, compare \u0060tiny_skia/src/layer.rs\u0060 and \u0060wgpu/src/layer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b523d1543c74ecabfb63bb3ff62e085d6e442ea1b163c2e2c157be52ed05176e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tiny_skia/src/text.rs:48-64 | tiny_skia/src/text.rs:75-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"528272cdfdbd940bbe413341eb01b2faa74393f264da6d80750787bc233f07ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tiny_skia/src/vector.rs:93-109 | wgpu/src/image/vector.rs:57-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/vector.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c34255607b5bbaa10c5f18c4f566acc98274d6d84f3f651aa90cec11bbf243b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): widget/src/column.rs:282-298 | widget/src/row.rs:288-304 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/row.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3307009001a11a87360e53e625114c01369d5e7effc34a3d61b18e2028a4065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): widget/src/pane_grid.rs:531-547 | widget/src/pane_grid.rs:549-565 \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 \u0060widget/src/pane_grid.rs:531\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":"widget/src/pane_grid.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8850505be6f4be19342daa92f72da3c8fd7f9ec12c2d57730995f159c6098b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): core/src/widget/operation.rs:167-182 | core/src/widget/operation.rs:289-304 | core/src/widget/operation.rs:368-383 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/widget/operation.rs:167\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":"core/src/widget/operation.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1393b22ce159fc8fd06a98f513722401307acb11bbe61ae39f30b5c2a195cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): runtime/src/user_interface.rs:246-261 | runtime/src/user_interface.rs:346-361 \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":"runtime/src/user_interface.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd3eb3bd3a49c3694b6786c0d7189ee79c974e1d312dc63f1241e568579b85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): widget/src/checkbox.rs:353-367 | widget/src/radio.rs:343-358 \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 \u0060widget/src/checkbox.rs:353\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":"widget/src/checkbox.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861267455a1d197ce4a7ef51df5de92e7fa2caca5cb23a5d1d46252a9358e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): winit/src/lib.rs:822-837 | winit/src/lib.rs:1153-1168 \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 \u0060winit/src/lib.rs:822\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":"winit/src/lib.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"4148c487ed6f1fec300179d40967273cf3ff38ac197b1ec59f9d90385c719cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): program/src/lib.rs:155-169 | program/src/lib.rs:246-260 | program/src/lib.rs:325-339 | src/application.rs:746-760 | src/application.rs:834-848 | src/application.rs:913-927 \u2014 before extracting anything, compare \u0060program/src/lib.rs\u0060 and \u0060src/application.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060program/src/lib.rs:242\u0060 calls \u0060title\u0060 and \u0060program/src/lib.rs:152\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":"program/src/lib.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab658913a1f320ba2dad215d681da681b491a681ae1121969efb3473773b25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): tiny_skia/src/geometry.rs:194-208 | wgpu/src/geometry.rs:301-314 \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 \u0060tiny_skia/src/geometry.rs:194\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":"tiny_skia/src/geometry.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d964004b28d2870e9fc4d0cea9b56caf1c1c4f8a2f7f09b3b3da21a48aaa3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): wgpu/src/image/mod.rs:231-245 | wgpu/src/image/mod.rs:283-295 \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 \u0060wgpu/src/image/mod.rs:231\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":"wgpu/src/image/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e5e47eff5bf985eaf9797cff37ed6e005adb0a5bcf8b12ab881cd95cd14dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): wgpu/src/quad/gradient.rs:152-166 | wgpu/src/quad/solid.rs:130-144 \u2014 before extracting anything, compare \u0060wgpu/src/quad/gradient.rs\u0060 and \u0060wgpu/src/quad/solid.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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 \u0060wgpu/src/quad/gradient.rs:152\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":"wgpu/src/quad/gradient.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0a71b7658d98272948b6e186aa763e07d4cfb61699501c2a9cac6a958ced6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): wgpu/src/triangle.rs:728-742 | wgpu/src/triangle.rs:872-886 \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 \u0060wgpu/src/triangle.rs:728\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":"wgpu/src/triangle.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a5304244970042ac92542f2c9dd4611f09a10b34eae2d782bc84637b26a845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): wgpu/src/quad/gradient.rs:152-163 | wgpu/src/quad/solid.rs:130-141 | wgpu/src/triangle/msaa.rs:96-109 \u2014 before extracting anything, compare \u0060wgpu/src/quad/gradient.rs\u0060 and \u0060wgpu/src/quad/solid.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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 \u0060wgpu/src/quad/gradient.rs:152\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/quad/gradient.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3b8399bed42d1df6f00e149cb05fa0639d748ebbf79154fb3a9099985ee2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/src/layout/flex.rs:209-222 | core/src/layout/flex.rs:245-258 \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 \u0060core/src/layout/flex.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/layout/flex.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13453552f042f08105ba99541bc27fcf85247f1d32f70e59eded87e16a4c2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tiny_skia/src/layer.rs:79-92 | wgpu/src/layer.rs:108-121 \u2014 before extracting anything, compare \u0060tiny_skia/src/layer.rs\u0060 and \u0060wgpu/src/layer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"511a9f72ec7fb6fd7da61ec97fb6b41599e6d9e16bb377166579cf363e3fbc07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): wgpu/src/image/mod.rs:155-167 | wgpu/src/quad/gradient.rs:151-163 | wgpu/src/quad/solid.rs:129-141 | wgpu/src/triangle/msaa.rs:95-107 \u2014 before extracting anything, compare \u0060wgpu/src/quad/gradient.rs\u0060 and \u0060wgpu/src/quad/solid.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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 \u0060wgpu/src/image/mod.rs:155\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":"wgpu/src/image/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d94798c83873d3e01d67a5753fdb769e725767b8aea5e9d56363fdc24416c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/src/widget/operation/scrollable.rs:50-62 | core/src/widget/operation/scrollable.rs:89-101 | core/src/widget/operation/scrollable.rs:124-136 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/widget/operation/scrollable.rs:50\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":"core/src/widget/operation/scrollable.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"343770e98c4f3ae4515be8ed2788b183ece529cf44283312fdf39875397a0ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/src/length.rs:132-144 | core/src/length.rs:159-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/length.rs:132\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":"core/src/length.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08552b4a9773e0762d9ed3961a5968f4c0ad8390ed01df55a1d20a475a3d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): graphics/src/gradient.rs:99-110 | graphics/src/gradient.rs:145-157 \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 \u0060graphics/src/gradient.rs:99\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":"graphics/src/gradient.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e5304379d3df0f381eac5878693ec14b91efc2c85accff198f3cb816e6f0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): widget/src/button.rs:377-389 | widget/src/container.rs:381-393 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/button.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89dce784a1c3c67994f6a950694cbd4272114eb30981f0d1eb7fad5fabf2d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): widget/src/canvas.rs:234-246 | widget/src/shader.rs:97-109 \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, \u0060widget/src/canvas.rs:232\u0060 calls \u0060Window\u0060, \u0060RedrawRequested\u0060 and \u0060widget/src/shader.rs:95\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/canvas.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c5956d45a3c067eb3a45e6a85ccaf93448e3676b9511bc1b13814e42f2887a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): widget/src/combo_box.rs:551-561 | widget/src/combo_box.rs:573-585 \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 \u0060widget/src/combo_box.rs:551\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":"widget/src/combo_box.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e75233257dde0cd84a48399d9ffe088ab5fa99bd791db327e2365b27997396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): widget/src/slider.rs:333-345 | widget/src/vertical_slider.rs:333-345 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:333\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":"widget/src/slider.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2fc5152cc0e861c8bc9bd1b46eea98d233f5cb0c042ba7579c713bb244b852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): widget/src/slider.rs:401-413 | widget/src/vertical_slider.rs:398-410 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060widget/src/slider.rs:399\u0060 calls \u0060update\u0060 and \u0060widget/src/vertical_slider.rs:396\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7ac87a352e240692b7c010f7dff7820970ba617e7ad4864bc36c0c39b560d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): graphics/src/text/editor.rs:321-332 | graphics/src/text/editor.rs:525-536 \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 \u0060graphics/src/text/editor.rs:321\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":"graphics/src/text/editor.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eb97d104f4bb9ec7e30809e3364790b174767a53217c2528620e51815b5a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/application.rs:190-201 | src/daemon.rs:132-140 \u2014 before extracting anything, compare \u0060src/application.rs\u0060 and \u0060src/daemon.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7a66c291a8151c0f1e1275f8c0cd1594cbd93914c216b93a3469997afede1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): wgpu/src/color.rs:170-182 | wgpu/src/triangle/msaa.rs:318-329 \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 \u0060wgpu/src/color.rs:170\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":"wgpu/src/color.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6843d48a7635d2b490eafc810870acf7afce4b467bf0884c7a1316701b74c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): widget/src/slider.rs:266-275 | widget/src/vertical_slider.rs:265-276 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:266\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5610ae0470ba5c4eed225bc3b2e3d0dae13f3c8ecd00930049b9090eb9cb5dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): widget/src/slider.rs:436-447 | widget/src/vertical_slider.rs:433-444 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:436\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":"widget/src/slider.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadd295b079f92362ddc1532a3c54331f6f311945259e5180e6ec0a9ca3684a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): widget/src/text_editor.rs:816-827 | widget/src/text_input.rs:600-611 \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 \u0060widget/src/text_editor.rs:816\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":"widget/src/text_editor.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d8419709dbe1894af088d3f720177d08d630d9de3511bf14a0438db58b766e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): winit/src/clipboard.rs:53-64 | winit/src/clipboard.rs:100-111 \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 \u0060winit/src/clipboard.rs:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060callback\u0060 to \u0060impl FnOnce(Result\u003CContent, Error\u003E) \u002B Send \u002B \u0027static\u0060 in one and \u0060impl FnOnce(Result\u003C(), Error\u003E) \u002B Send \u002B \u0027static\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":"winit/src/clipboard.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e886e8cbdb4ee9135cdd4e68376005549605e8ec5a23341f72cf36123607ce84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): core/src/widget/operation.rs:191-200 | core/src/widget/operation.rs:274-284 | core/src/widget/operation.rs:313-322 | core/src/widget/operation.rs:392-401 \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 \u0060core/src/widget/operation.rs:191\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":"core/src/widget/operation.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"20297424b93fce95e1a5806804fd8252ecc810d993e9b84fd274e179d729d9ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/src/widget/operation.rs:178-188 | core/src/widget/operation.rs:248-258 | core/src/widget/operation.rs:300-310 \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":"core/src/widget/operation.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c4a5c19bab53cabd3dff22e1d29f88a20e1094a7117364c20d6e07e1c6a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): program/src/lib.rs:174-184 | program/src/lib.rs:344-354 | src/application.rs:932-942 \u2014 before extracting anything, compare \u0060program/src/lib.rs\u0060 and \u0060src/application.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"program/src/lib.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c29fb1731e71040dcc9dd8db844acbd5e3e8d4238cb0f7db81294e49436241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/src/color.rs:335-345 | core/src/color.rs:346-356 \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":"core/src/color.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1444e78c561fa5d60413ecdb665231a5696bd7d94d3eca905aecdd962a22b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/application.rs:765-775 | src/application.rs:848-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060state\u0060 to \u0060\u0026Self::State\u0060 in one and \u0060\u0026mut Self::State\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/application.rs:761\u0060 calls \u0060theme\u0060 and \u0060src/application.rs:845\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"df00be4d210521e2636398cbfdca784805e62940310cc9c2d8d604d0865d9e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tiny_skia/src/engine.rs:213-223 | tiny_skia/src/engine.rs:256-266 \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 \u0060tiny_skia/src/engine.rs:213\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":"tiny_skia/src/engine.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b90ff9b4b1e20dec3cba88d94e2f83d23f25ae61393d029f45666a662def18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): wgpu/src/geometry.rs:177-187 | wgpu/src/geometry.rs:238-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/geometry.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32c1b2ead58b3663bc40cc1ba3bc0587f2a7512a2fd93c2571a9e1d8dcbc4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): wgpu/src/image/atlas.rs:68-78 | wgpu/src/image/atlas.rs:469-479 \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 \u0060wgpu/src/image/atlas.rs:68\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":"wgpu/src/image/atlas.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818f567c3d25ef1a190e6cd2ff570187e7b128c669831bbbf5e6bfddc086324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): widget/src/overlay/menu.rs:448-458 | widget/src/overlay/menu.rs:477-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/overlay/menu.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4984cf5b7c541e2dae9736d1bf6c9efbf588c2e84b0d0e26a02aab466324a7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): widget/src/slider.rs:459-469 | widget/src/slider.rs:473-483 \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 \u0060widget/src/slider.rs:459\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":"widget/src/slider.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b9625ffc31dbe7ff24d58fcdbb6dfcd4953bbe6e4117d9d14cdac8ab4172a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): widget/src/column.rs:224-233 | widget/src/grid.rs:240-249 | widget/src/keyed/column.rs:257-266 | widget/src/row.rs:230-239 | widget/src/stack.rs:181-190 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/keyed/column.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a88732f766ed1ed55f9b666bdbfe39e34a322fd886012c2283e4ff6606c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): widget/src/button.rs:352-361 | widget/src/slider.rs:405-414 | widget/src/vertical_slider.rs:402-411 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/button.rs:352\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/button.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8306bb757622d699db7084a7fefe9aa5c412ff50296d8c3baff9c88de35cd30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): beacon/src/client.rs:252-261 | beacon/src/lib.rs:286-295 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"beacon/src/client.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42601d89aa4a64aeadf1f7725ff3e5b36151cd91b8f63b418526802e6cd381a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/widget/operation/focusable.rs:125-134 | core/src/widget/operation/focusable.rs:157-166 \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 \u0060core/src/widget/operation/focusable.rs:125\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":"core/src/widget/operation/focusable.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add77d9619757cc6cd09d71bea67ce199714a4f8a80950f8c47d0a9db83268a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/widget/operation/text.rs:101-110 | core/src/widget/operation/text.rs:123-132 \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 \u0060core/src/widget/operation/text.rs:101\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":"core/src/widget/operation/text.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f837bd7837d5988c7fb8b14101ee8a87e1d95dd61c5d3b7fbd3cae1e6a7305d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/application.rs:113-122 | src/daemon.rs:57-66 \u2014 before extracting anything, compare \u0060src/application.rs\u0060 and \u0060src/daemon.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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 \u0060src/application.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d439679a17e878d051abf45ba2576c8394345b85d65ecff88c3861abf319e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/application.rs:128-137 | src/daemon.rs:80-89 \u2014 before extracting anything, compare \u0060src/application.rs\u0060 and \u0060src/daemon.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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 \u0060src/application.rs:128\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc64cb7ac2cc9fa3af140731720042583e8b8c8b63875ef8c66ce50425c12695"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): wgpu/src/color.rs:80-89 | wgpu/src/triangle/msaa.rs:51-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060wgpu/src/color.rs:80\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":"wgpu/src/color.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce71fe47fde4ac41b9ecd7b3d5f3fdfc9742c835b5f503593e2f0f9845cae2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): widget/src/component.rs:258-267 | widget/src/component.rs:474-483 \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 \u0060widget/src/component.rs:258\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":"widget/src/component.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35a13385e43e903471d5de57ee293a14e735116f41ba9d2e601cb4ef76f3f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): widget/src/markdown.rs:1258-1267 | widget/src/markdown.rs:1286-1295 \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":"widget/src/markdown.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35ce6e2de39bfb973f04228508050ee9f6291fc6cfacbe56b032a065e007ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): widget/src/sensor.rs:191-200 | widget/src/sensor.rs:203-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/sensor.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce68faa32f290bd147c00bc602226d41a266551fbc4b0741b884c7d40551b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): widget/src/text_editor.rs:797-806 | widget/src/text_input.rs:581-590 \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 \u0060widget/src/text_editor.rs:797\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":"widget/src/text_editor.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f53fb25d5baccdf8d57c0fc9c60417fb63e25096b47d019fc032350e53fb762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): widget/src/column.rs:262-270 | widget/src/grid.rs:278-286 | widget/src/keyed/column.rs:295-303 | widget/src/row.rs:268-276 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/keyed/column.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e658a8515702742e8c00e72e0fd058895a57e0ce070d237ea2259079b3b3c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): selector/src/target.rs:203-211 | selector/src/target.rs:215-223 | selector/src/target.rs:227-235 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"selector/src/target.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0404b55283d4d040c8990df733536ad53738eeab02a0c1c9d12bd066122855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): beacon/src/client.rs:238-246 | beacon/src/lib.rs:301-309 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"beacon/src/client.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a01988c57319f4039b307c33fba36321533059a38a589d7966988f698e23dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/src/gradient.rs:67-76 | graphics/src/gradient.rs:66-75 \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 \u0060core/src/gradient.rs:67\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":"core/src/gradient.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e9c97e5cf4f5fd79a848af0bfd786a7da80a620e373799163654b0442362e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): futures/src/subscription.rs:322-330 | futures/src/subscription.rs:378-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 \u0060futures/src/subscription.rs:322\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":"futures/src/subscription.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"304491bf7895b16c03ad32e9357184a10cd5efa1a0870003e6c8b4171fe80757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): selector/src/target.rs:50-58 | selector/src/target.rs:62-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"selector/src/target.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"550cc0a84ff508d0c3340855b7966b60e4f32930803566b6747c6549f25226c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/application.rs:117-125 | src/application/timed.rs:59-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbcc1c07dbd6909c0c38258584add070059288f6c4f96d8f0f8dc8f9fd1c459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): widget/src/column.rs:181-189 | widget/src/keyed/column.rs:214-222 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/keyed/column.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/column.rs:181\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":"widget/src/column.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec49655945cffa4621094987f8bbe253442876e6236333b2ecfac2dd1df874e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): widget/src/column.rs:380-388 | widget/src/row.rs:385-393 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/row.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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 \u0060widget/src/column.rs:380\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":"widget/src/column.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4851028b385e8be4270ae6756826e768d80b3c1559680e97c690f0c9741d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): widget/src/image.rs:278-286 | widget/src/svg.rs:243-251 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/image.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77718aee5fcc4d12c8a0896d43f9ba71bb99f97132909d50db65ef613e9b231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): widget/src/slider.rs:426-434 | widget/src/vertical_slider.rs:423-431 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c47a9aa644ce8026b0a154eff6069b5d5535cbcb32d1a8bd7d844c42477d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): program/src/lib.rs:181-188 | program/src/lib.rs:351-358 | src/application.rs:772-779 | src/application.rs:855-862 \u2014 before extracting anything, compare \u0060program/src/lib.rs\u0060 and \u0060src/application.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060program/src/lib.rs:181\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":"program/src/lib.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f551aaa0b129eb486f767034fbd5846713e393122f8f3b4ed740b007d08dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/src/widget/operation/text_input.rs:33-40 | core/src/widget/operation/text_input.rs:58-65 | core/src/widget/operation/text_input.rs:108-115 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/src/widget/operation/text_input.rs:33\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":"core/src/widget/operation/text_input.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a90a7de987e15384ac439ef843185d700b7abe98a1fcfe0e352fd39b60426b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): widget/src/checkbox.rs:292-299 | widget/src/toggler.rs:272-279 \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 \u0060widget/src/checkbox.rs:292\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":"widget/src/checkbox.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15695ae1210fc385af440e33e8801c9743bf4a37c76c831973129d5b911de89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): widget/src/pane_grid.rs:692-699 | widget/src/pane_grid.rs:782-789 \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 \u0060widget/src/pane_grid.rs:692\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":"widget/src/pane_grid.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda2fad78125208dd53fc2dc562ced7adf1d89765d322f4b92ddcd5e44f85409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): program/src/lib.rs:179-185 | program/src/lib.rs:349-355 | src/application.rs:770-776 | src/application.rs:853-859 | src/application.rs:937-943 \u2014 before extracting anything, compare \u0060program/src/lib.rs\u0060 and \u0060src/application.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060program/src/lib.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/application.rs:766\u0060 calls \u0060subscription\u0060 and \u0060program/src/lib.rs:176\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":"program/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf108ca2d06622b43e93343970de2e097cdd4487c32cf7aa95a372206560609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/application.rs:715-721 | src/application.rs:798-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b0d6cb82a4991c575a359a9cc9ebd06c8d185f8b70664bcf72acd6d1dc87e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): widget/src/pane_grid/title_bar.rs:326-332 | widget/src/pane_grid/title_bar.rs:375-381 | widget/src/pane_grid/title_bar.rs:440-442 | widget/src/pane_grid/title_bar.rs:490-492 \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 \u0060widget/src/pane_grid/title_bar.rs:326\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":"widget/src/pane_grid/title_bar.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eedba51c2d3a225e6c44da80c3693668855fd6863a958bd8cc31c2845fa0d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): widget/src/slider.rs:348-354 | widget/src/vertical_slider.rs:348-354 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:348\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":"widget/src/slider.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"890848feab828760d9a0b717159f7b7711a8bd30e2036c016b3c0b73c282260f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): widget/src/slider.rs:357-363 | widget/src/vertical_slider.rs:357-363 \u2014 before extracting anything, compare \u0060widget/src/slider.rs\u0060 and \u0060widget/src/vertical_slider.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 178 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 \u0060widget/src/slider.rs:357\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":"widget/src/slider.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10e1c126df8d5ae2506f461623ce47d699849192e6d33edae9e2c9e254d0115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/application.rs:117-122 | src/application/timed.rs:59-64 | src/daemon.rs:61-66 \u2014 before extracting anything, compare \u0060src/application.rs\u0060 and \u0060src/daemon.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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 \u0060src/application.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79b6cd2c08860202e223e2fe829449461d461789118dabb60f4d618e2073000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): wgpu/src/image/atlas.rs:385-390 | wgpu/src/image/atlas.rs:395-402 \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 \u0060wgpu/src/image/atlas.rs:395\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":"wgpu/src/image/atlas.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"64164787b5da512dd08961d050124a84eb2ef4c41990ef4b2191a88a21941400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): wgpu/src/quad/gradient.rs:182-187 | wgpu/src/quad/solid.rs:153-158 \u2014 before extracting anything, compare \u0060wgpu/src/quad/gradient.rs\u0060 and \u0060wgpu/src/quad/solid.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/quad/gradient.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7222991e0681d7646cef064b9aa7076a17904e6fd6363a6bbd087306413cd9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): widget/src/button.rs:231-236 | widget/src/container.rs:211-216 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/button.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5dc1e7d0393b8b6b9b09d9f1e40155a23a09170ddb6ce8b05b81833db604fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): widget/src/table.rs:244-249 | widget/src/table.rs:320-325 \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 \u0060widget/src/table.rs:244\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":"widget/src/table.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a796cf447a3cbe3107689d0b797acedce9457812fc550dbda327e96957ff063b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): widget/src/scrollable.rs:799-803 | widget/src/scrollable.rs:950-954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060widget/src/scrollable.rs:804\u0060 calls \u0060position_over\u0060 and \u0060widget/src/scrollable.rs:955\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":"widget/src/scrollable.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cccb930f3a99cd7e26ac00caea2e05bbb26732314e8ebae3d577f70e1efe3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/src/text/editor.rs:85-90 | widget/src/text_editor.rs:677-682 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b06b884cd8c47c2c4df883af9f46ec9c4e3ee1054e7debf2df707329316b7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/src/widget/text.rs:185-192 | widget/src/text/rich.rs:177-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/text.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403bcfcacc6b7a79a67f24965d048c475c6df1e8381ef50fe00f9b60b10eaa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphics/src/text/editor.rs:908-913 | graphics/src/text/paragraph.rs:654-659 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"87324e6c7e31a13d7fd8b0f222ec315c8dab302946b42038e8464fa2ca303d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): tester/src/recorder.rs:126-130 | widget/src/mouse_area.rs:175-179 | widget/src/opaque.rs:132-136 | widget/src/popover.rs:236-240 | widget/src/sensor.rs:259-263 | widget/src/sticky.rs:126-130 | widget/src/tooltip.rs:159-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tree\u0060 to \u0060\u0026mut widget::Tree\u0060 in one and \u0060\u0026mut Tree\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":"tester/src/recorder.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"420a0d4304036263b885275f7d2e8f603488c76e4e978678fbe6fb6931824e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tiny_skia/src/geometry.rs:218-223 | wgpu/src/geometry.rs:265-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/geometry.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c97694b435eebf347efaca2b233561089decf5899928a8ebe9b76f7690957b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tiny_skia/src/layer.rs:151-162 | wgpu/src/layer.rs:160-171 \u2014 before extracting anything, compare \u0060tiny_skia/src/layer.rs\u0060 and \u0060wgpu/src/layer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tiny_skia/src/layer.rs:151\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":"tiny_skia/src/layer.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"07950d2e87c683b75620312ad3ef2c487ef8ea7578891db8a25264da173356e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tiny_skia/src/layer.rs:170-178 | wgpu/src/layer.rs:179-187 \u2014 before extracting anything, compare \u0060tiny_skia/src/layer.rs\u0060 and \u0060wgpu/src/layer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tiny_skia/src/layer.rs:170\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":"tiny_skia/src/layer.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b69bfad606a257c75f7f04779f7ad7140ada5c26101cc8d4de9f54c817a654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tiny_skia/src/lib.rs:262-266 | wgpu/src/lib.rs:743-747 \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 \u0060tiny_skia/src/lib.rs:262\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":"tiny_skia/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"af88ba8afc22e79577f51003ca226658df4d2cb85b73547726b8ccbfb67b4fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): wgpu/src/quad/gradient.rs:52-57 | wgpu/src/quad/solid.rs:46-51 \u2014 before extracting anything, compare \u0060wgpu/src/quad/gradient.rs\u0060 and \u0060wgpu/src/quad/solid.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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 \u0060wgpu/src/quad/gradient.rs:52\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":"wgpu/src/quad/gradient.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af25b0923b4ee9d64d2abb6b829b76fd7757ea8990c83cd0ea26905239402ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): widget/src/button.rs:435-440 | widget/src/container.rs:338-343 | widget/src/opaque.rs:222-227 | widget/src/pin.rs:218-223 | widget/src/responsive.rs:147-152 \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 all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/button.rs:435\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 \u0060tree\u0060 to \u0060\u0026mut Tree\u0060 in one and \u0060\u0026mut widget::Tree\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":"widget/src/button.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"858005122f5d0ad900a28d28a1556dba692499628680cb6ea95b6994167d464b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): widget/src/canvas.rs:270-275 | widget/src/shader.rs:119-124 \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 \u0060widget/src/canvas.rs:270\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":"widget/src/canvas.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1712d9442014e4268bcb80fc9d78224c73f4b23543c45b6a141d5e6ca09b0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): widget/src/column.rs:64-74 | widget/src/row.rs:70-80 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/row.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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":"widget/src/column.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"082e5080b9d4d183d3945ea354aaf66edf080ed78a0b28057ec9018a3be11b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): widget/src/column.rs:244-252 | widget/src/grid.rs:260-268 | widget/src/keyed/column.rs:277-285 | widget/src/row.rs:250-258 \u2014 before extracting anything, compare \u0060widget/src/column.rs\u0060 and \u0060widget/src/keyed/column.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/column.rs:244\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":"widget/src/column.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d38a82fd7513b6f0ac01a3c6325b5c6b1c6453ea89a4e70f358a7d4f6a276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): widget/src/container.rs:273-278 | widget/src/pin.rs:162-167 | widget/src/responsive.rs:88-93 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/container.rs:273\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 \u0060tree\u0060 to \u0060\u0026mut Tree\u0060 in one and \u0060\u0026mut widget::Tree\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":"widget/src/container.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76488c39d6a0f89197d9bd3f31bb2ce22ec1b630dcab5f6546461cf7bfd130c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): widget/src/container.rs:287-292 | widget/src/pin.rs:176-181 | widget/src/responsive.rs:118-123 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/container.rs:287\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 \u0060tree\u0060 to \u0060\u0026mut Tree\u0060 in one and \u0060\u0026mut widget::Tree\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":"widget/src/container.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1914ffa02c28b7b16d2f71e692a705254200c087069472e01347a101160d509a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): widget/src/mouse_area.rs:249-259 | widget/src/popover.rs:272-282 | widget/src/sensor.rs:274-284 | widget/src/tooltip.rs:270-280 \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 all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/mouse_area.rs:249\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 \u0060tree\u0060 to \u0060\u0026mut widget::Tree\u0060 in one and \u0060\u0026mut Tree\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":"widget/src/mouse_area.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b944ab491993b37c50654ab337898a10c23956b15ba5a3f3b9c57c4e75d92557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): widget/src/opaque.rs:147-152 | widget/src/responsive.rs:104-109 \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 \u0060widget/src/opaque.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/opaque.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"430a325c0c145b75def62315d3dade497e5ecfbcbb650aa0b32ba2d2d093cc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): widget/src/opaque.rs:161-166 | widget/src/pin.rs:146-151 | widget/src/responsive.rs:132-137 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060widget/src/opaque.rs:161\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 \u0060tree\u0060 to \u0060\u0026mut Tree\u0060 in one and \u0060\u0026mut widget::Tree\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":"widget/src/opaque.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eebf2b53e7aaaf7a73ea5891a3aa7e540060d5f08aee845535fd6e9a9475cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): widget/src/popover.rs:303-309 | widget/src/tooltip.rs:366-372 \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 \u0060widget/src/popover.rs:303\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":"widget/src/popover.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa35ff29aeb92ba28a4edf7c77a19b9999670947217d972786932f5e18aa5218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): widget/src/popover.rs:516-525 | widget/src/sticky.rs:420-429 \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 \u0060widget/src/popover.rs:516\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":"widget/src/popover.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"101a945ab8cf4920585e3ca8d6ba9ad6c77451e62d522ef06c98ef53a4d2e0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): widget/src/combo_box.rs:636-642 | widget/src/radio.rs:367-373 \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 \u0060widget/src/combo_box.rs:636\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":"widget/src/combo_box.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a37eb576cfe63d7011e4a74aed342da17c2915b8d6dc7347b581855460e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): wgpu/src/image/mod.rs:61-86 | wgpu/src/triangle/msaa.rs:28-53 \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 \u0060wgpu/src/image/mod.rs:61\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":"wgpu/src/image/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fefe47e39665ae893642c07d0f82fc062870f99d5810e558d949d30b38e6e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): wgpu/src/triangle.rs:640-656 | wgpu/src/triangle.rs:772-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060wgpu/src/triangle.rs:640\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":"wgpu/src/triangle.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6809b79967fb423c4a25da25e186db9706856b233d02d3953b269d71376a157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): wgpu/src/triangle.rs:688-696 | wgpu/src/triangle.rs:820-828 \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 \u0060wgpu/src/triangle.rs:688\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":"wgpu/src/triangle.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78ddaa67978dde7430826529184bde377e565453a2151d5572dfb01506665a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): wgpu/src/quad/gradient.rs:78-85 | wgpu/src/quad/solid.rs:68-75 \u2014 before extracting anything, compare \u0060wgpu/src/quad/gradient.rs\u0060 and \u0060wgpu/src/quad/solid.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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 \u0060wgpu/src/quad/gradient.rs:78\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":"wgpu/src/quad/gradient.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"be94d9a14dc42cf3018e6ee58e415d42e6c4a0b1e17c294280047e85084606a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): widget/src/overlay/menu.rs:511-515 | widget/src/overlay/menu.rs:576-580 \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":"widget/src/overlay/menu.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3612db72f5ba4113d9e02cf93be1aa74cd98a1234ec60f33f74e2cfda072b9"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project iced_test: iced_test has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bff8a56dbd31e6a5d958378835f89b5ad88d223b98a59ed1e50c0f7679f9fe18"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: iced_core: iced_core: abstractness 0.18, instability 0.00, distance 0.82 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c4e6a3eb88330be667e4813ac584f41bf6ae0575d155a4ad6f2fb7ef312f13a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MouseArea (LCOM4 12): MouseArea\u0027s methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/mouse_area.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe13426483b0c47d67285d22693ee9879d0ae6f516c5b40b90da60fc8bab4ec"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Lazy (LCOM4 7): Lazy\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/lazy.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"345dbbba0b0e745794148892e8a4164ae28388c7d56b9ab2a8a89ac7e70df2dd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Radius (LCOM4 4): Radius\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/border.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6761351a86ab3b59719ad94f71ccce8db6ab493d1f286d6fb07bce001c27572"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: beacon/src/client.rs: 0.0% line coverage (0/152)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"beacon/src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56afdcab2b800b546f96935758e1e7eba141c5efe65e2383605d58816405b824"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: beacon/src/lib.rs: 0.0% line coverage (0/188)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"beacon/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff33a00553e621ee70932fc4919af6c68ccb0af795eda0204d47af8998e0e5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: beacon/src/span.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"beacon/src/span.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21091295b6bb6e50a411a21b570fb5e0e43fe7e68d5d1a0587bd456af60d2a47"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: beacon/src/stream.rs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"beacon/src/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a754b47878b5624f331ad681940669ae26d9279985972c6e81804e1f82b1f4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/angle.rs: 0.0% line coverage (0/108)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/angle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106c508f6e24726169229b5f51d3451d76ef715e491ecc52c6e2292d5cda7a0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/animation.rs: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/animation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6794f40581dfdc53c98d97eb08728bc3fc2abdec1be30e8cc48d6719cd5d2f0a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/backend.rs: 5.5% line coverage (4/73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c8a1079a9856baaca57a4fb1da08cb2f422d8bab69487cb17a068c2d425d66"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/background.rs: 21.4% line coverage (3/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/background.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a3831923095499464d456304ea337f38934331f069ee1a813a7601b8c2ed7b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/border.rs: 23.0% line coverage (35/152)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/border.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecbb88078b8374bd0ababb6ddc9e2e066c7834114ba35a536888e91478d78d4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/clipboard.rs: 45.5% line coverage (10/22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/clipboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a03b956f04a991c560a1ebcbe7d22c8495693b4fa046a5b1ef113a7070e1a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/code.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb69196e032364ce0ae7c2b143d101d95abb5ad170cb472a9d5ac165e8e41ce"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/content_fit.rs: 0.0% line coverage (0/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/content_fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9b5d0ce000cf49769a7cd4f8bba3c8719d90df795bef8b01e2a9d452fb5653"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/font.rs: 0.0% line coverage (0/47)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/font.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92496dc41328c5e2b9e10f963b8b5ab56419525877d845db75ad020e6a388ab5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/gradient.rs: 0.0% line coverage (0/37)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/gradient.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9376ed79d4b93e03b5aae3831aa2c313e7e2ddf9887aa6e90dbb66006b533ae8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/image.rs: 0.0% line coverage (0/87)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc9beca11b179821d49949232f247be44acb643061110d65ef60373e6259cf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/input_method.rs: 31.1% line coverage (14/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/input_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8653dc8c76c8ddb35a369a451a5bed538429d3b3103382ae3ad4d902724d3ff0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/keyboard/key.rs: 17.3% line coverage (13/75)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/keyboard/key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7200189991c92c511c1f939e6bb200f7581bef273a9ff112924eb91f56f9f3e7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/keyboard/modifiers.rs: 11.5% line coverage (3/26)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/keyboard/modifiers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2202a9a0a95118c4077fb65997d6a43bc06250f1861d1a7411644762910e1814"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/lib.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"131895a7a42a0441e34adef55de36181e7119676c00555091bf5e2f0b5f782fa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/mouse/click.rs: 32.6% line coverage (14/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/mouse/click.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4883c6a18408e6717ab9a278367c0c474d56d2d2a39ac0bcaceca1e8e029de5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/overlay/element.rs: 14.3% line coverage (9/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/overlay/element.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea6a4c13baa5e3c49cb76057b0df199a865cb51f8c18019c23f698adf8f1c26"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/padding.rs: 29.0% line coverage (36/124)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/padding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa6c04e47598f665a6575ff30048813d0a9ea181900a18e6fc58c265257dba4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/pixels.rs: 40.0% line coverage (12/30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/pixels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d369a2b70ba8db0df5d3a3af5c6a72ef02a15ccd0943c46821660ae901ab01"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/rectangle.rs: 38.5% line coverage (104/270)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/rectangle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598d28aa8ed78b3aeef883702f0d90cb16039a10d6ece4ce6169f5be315b026e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/renderer/null.rs: 5.8% line coverage (11/191)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/renderer/null.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabd9a528487469b265f9c10eb49c1e66b0415dd6e0ca092a1b0179c17c4b0f0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/rotation.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/rotation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7660d961b3aab8790a69de690c7b068797de7ebaa7d0a8d4d49587ecf7c2e8d5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/size.rs: 44.3% line coverage (43/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/size.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52ce4aed1cbca542fef47cd425686731bb1c976bff5f9540c39178aa302d207"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/svg.rs: 0.0% line coverage (0/54)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/svg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e51ebf1c3d8809252933a1c79526e3019182a4c458ba4e2d4e470952d67f11"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/text.rs: 31.1% line coverage (69/222)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a229fc97bb6ac526f91e2bca950091674f11fb3f51a55bf1e937311f136fc3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/text/editor.rs: 0.0% line coverage (0/432)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"115bbf5b72332b85b73bfdd9d47f9d005404d5db68b2080bae9f1a03a6577f83"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/text/highlighter.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/highlighter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d150d012cef7464c6d6d2322d909449ce118a9275468d73527998807618b5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/text/input.rs: 0.0% line coverage (0/265)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd894aab4ec4e5bb021a7418eb8b1a8d43a9d7fa856f9624647157783fd514a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/text/paragraph.rs: 31.3% line coverage (21/67)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec27e399dd9a3f83b974d259aa0aaa88471860e6ce764c4f9cbb5cda658eb2c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/text/parser.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7716ffd7584ceded0a75634dc5633b7f9c6e9b0382e8aae6ecd985081f15f6cd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/theme.rs: 9.9% line coverage (14/141)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/theme.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0011f16e323eab079f64a2572e3df7274f77b7a9885bfcc1823cabde62c1735c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/time.rs: 0.0% line coverage (0/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/time.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f461350c01df5f79f4161be96c8fac0bc08c6cbef7cc0c8b6c25180d1eda826e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/transformation.rs: 43.3% line coverage (26/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/transformation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dceb653cece8eeaf68ca694da348bb1202a77424187b0c6a1c3a1d5d186698"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/widget.rs: 32.9% line coverage (115/350)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88585c60ab20e0f715e52fc7f03006255f76415ca2b0f596cf0abb3df7c023"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/widget/operation.rs: 11.5% line coverage (31/270)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2ee39405e0028bf1dfbb11ce2cd3ff7f6fb34b0c850e3c684708cc4c31488c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/widget/operation/focusable.rs: 0.0% line coverage (0/114)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/focusable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354c37560c916e805d90a692e0da75823e4c264292cf2a8bd4880e275da2b7d6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/widget/operation/text.rs: 16.3% line coverage (16/98)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f743ee0bb2738143d6b374faf9a916b6a9a81b20594723fa10c05a1817ab4efb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/widget/operation/text_input.rs: 0.0% line coverage (0/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/text_input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"038a5a5f6feff2a9d3ce46deedf57fe4c31007b4ded9ecb5e7865d4ddda39b8c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/widget/text.rs: 44.4% line coverage (183/412)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675257d0a1b724989ab5103dce9cb9a3235f8b5ebc877281753e9c49ed9ce393"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/window.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8cf5879cd717ce62344e446b7d97de052afade0226e54be3450bc36a60657e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/window/icon.rs: 0.0% line coverage (0/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/window/icon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af873940f532ebc06137398d8c4d86f01b3038c78e6532d4763efef02dff3d0c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/window/id.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/window/id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a42a9ae776e38a1ce3550fb0b3fb6e8e4fbde00b4e6db456b35b3d6106de101"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: core/src/window/screenshot.rs: 0.0% line coverage (0/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/window/screenshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee95dd46b0a1fe6117d7a1d514c5d9fff1c88c9cb02a8d7d8e116dd6689356ea"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: debug/src/lib.rs: 0.0% line coverage (0/203)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b704d05293a64e5b51b7006ff55b7b00f4a2cce4269924ba9c799440f79496"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: devtools/src/comet.rs: 0.0% line coverage (0/65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"devtools/src/comet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f07282e40bedd76d94fb813c38319950ed87e2733637ff7313082166e8e4629"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: devtools/src/lib.rs: 0.0% line coverage (0/306)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"devtools/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf0ec462ac9194e1d5bd4c3078f08bf52c859f8255f4a4546e78960f28bbffe"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: devtools/src/time_machine.rs: 0.0% line coverage (0/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"devtools/src/time_machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a795beb0e08dfde01e28d3d554a598399dcb11b364745a008ce11107c337c2c1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/arc/src/main.rs: 0.0% line coverage (0/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/arc/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aff312944bc759cdb430b8c55fdf4c8dad074aad6f8da0e14b0291ed8c2c40"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/bezier_tool/src/main.rs: 0.0% line coverage (0/148)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bezier_tool/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab12cc81cb1dc59970d1ef18e61baae9e8e7d878ab4a682090955cb5b5353451"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/changelog/src/changelog.rs: 0.0% line coverage (0/211)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/changelog/src/changelog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efdf2c75e1aabb2aee0397fc9518defa0a05b0d72ed5a9b0813e52a767fa04b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/changelog/src/main.rs: 0.0% line coverage (0/207)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/changelog/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df13ca3145a35f6c862f61e2a09b5ac28cc47bd557471bf4373e92e35baeb6f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/checkbox/src/main.rs: 0.0% line coverage (0/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/checkbox/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97609d99416815d812ac836eebb9a469f3d6313979171192a9fdf52f8a3653d4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/clock/src/main.rs: 0.0% line coverage (0/126)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/clock/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a1fd774fd17978d49c9a263ff886e00935490160735719db4d4e528f20ff39"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/color_palette/src/main.rs: 0.0% line coverage (0/296)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/color_palette/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd83bad630bc6365e54832bc28cba6d306068c412ff646e267828d5b9772b59"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/combo_box/src/main.rs: 0.0% line coverage (0/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/combo_box/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac9085fa7e9cc586b679ef26d552563e5d97691804a2861d5b29bb3b683b170"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/component/src/main.rs: 0.0% line coverage (0/64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/component/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b01e24c51766b08665f2e642b4b501328aad5d4afdc9e93a283d34ed3967902"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_quad/src/main.rs: 0.0% line coverage (0/133)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_quad/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089ea9451bcdb70744133599434f4f979753ae68be528b12b967c410218315a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/main.rs: 0.0% line coverage (0/92)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce53248018c67313ad6dd83a835cbe918459fef7513379fa64ecc81131b1ee6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene.rs: 0.0% line coverage (0/105)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"765f8a55f0d6bf38b050f42a36016837bb1b0c54603c8fc483990249c55f8b99"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene/camera.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene/camera.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040a286523ca64c416693f4b1e6573a7c52b3b267390f124250da0673ca6761"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene/pipeline.rs: 0.0% line coverage (0/483)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"298341d4f94bafc039d906b95aa58494482add49f6d206361cab252a3ddf053c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene/pipeline/buffer.rs: 0.0% line coverage (0/27)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene/pipeline/buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0497af7310eecf017eda8c96aef2fd94582c35d09bd425416e76fd731763ca20"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene/pipeline/cube.rs: 0.0% line coverage (0/269)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene/pipeline/cube.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19d5e53d908b4d9939da1bca19c548359c8cf11cb25ab8534ffd8cb86cec9c3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene/pipeline/uniforms.rs: 0.0% line coverage (0/8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene/pipeline/uniforms.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a474f7a65256cc229b0fa3feb0774400651807a2269ff826c408621f30544840"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_shader/src/scene/pipeline/vertex.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_shader/src/scene/pipeline/vertex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0c95a1efd3890b66c9fa4076d57d57d76e0456c24afe02ab794b18bea911f8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/custom_widget/src/main.rs: 0.0% line coverage (0/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/custom_widget/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7e7fc1d257623a85fa51d8c3fb695c6172cfa5782c18257e1e26c9bfde4669"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/delineate/src/main.rs: 0.0% line coverage (0/94)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/delineate/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0577cfbcbd3a60e19a83127003ed75d8c5312ba571b0a11f5251d05ed473a26"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/download_progress/src/download.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/download_progress/src/download.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0810fd109b7511abb0c11b51e9aa44673697531e9a238f47654750a8ad70b292"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/download_progress/src/main.rs: 0.0% line coverage (0/102)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/download_progress/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1ee47a38d690f03d2928181abadff54229d70694581cf7e383d5724361d411"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/editor/src/main.rs: 0.0% line coverage (0/197)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/editor/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef958a8d04f23a9f84bc6f8d7c96c29acbbc91dd802317408ff51a8b7c3daf6c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/events/src/main.rs: 0.0% line coverage (0/38)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/events/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"092d2801159a33e7ab9862ddbfd27445f3166ac819155dcdd1289c9ce3e9ee28"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/exit/src/main.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exit/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9a8bdf7a80347ffad8f5330b8caa1f56b2cad8f8d821d3d95eb4224c308100"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/ferris/src/main.rs: 0.0% line coverage (0/114)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ferris/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"754f6d8621100e762ffe045d2af0f896ec45e8f6959c244466e5e6ac120e6abc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/gallery/src/civitai.rs: 0.0% line coverage (0/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/gallery/src/civitai.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a011f30bbfa353a21eef28f9cf9c4d1bbbe407623d5c891fe9941ddb45a910"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/gallery/src/main.rs: 0.0% line coverage (0/360)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/gallery/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e3af54f7c3faa33a9b7e29baf408460c3d209a1d9605f01fb17026c3ffbc3a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/game_of_life/src/main.rs: 0.0% line coverage (0/545)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/game_of_life/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98436af405ff95157513334f55d4750b4dfd6a36edeefc31a73f19f28ff6c143"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/game_of_life/src/preset.rs: 0.0% line coverage (0/76)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/game_of_life/src/preset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83ceae50e3e4a4ffdd98f2eceae14638ace018d4d476ccc2609a4e06ba19192"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/geometry/src/main.rs: 0.0% line coverage (0/133)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/geometry/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f8405c0675f8e3f51b1302c00fbd6ccf4c8269a6dba12976696c13bc4303c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/gradient/src/main.rs: 0.0% line coverage (0/75)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/gradient/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8337e15dc1ac53cd4d4086db7e750d42aa6db46091229e7550ffbdcd5e76664"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/integration/src/controls.rs: 0.0% line coverage (0/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/integration/src/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f67a9e1cece470d9dcfe567f2d85ed899f6cd09128af29295785bb54f2c9237"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/integration/src/main.rs: 0.0% line coverage (0/247)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/integration/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5818af72fee529e64535502af3abbb929b426b8554d788b408029d10d4ee4515"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/integration/src/scene.rs: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/integration/src/scene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35320262aa33c859022e27f52ff3ec3ee79e82f3a618a1f4fe1a180bbc9440e9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/layout/src/main.rs: 0.0% line coverage (0/235)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/layout/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5b4f05a2fb4183feb09159b22146b026e7b672064219725eb2f43f726b5694"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/lazy/src/main.rs: 0.0% line coverage (0/112)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/lazy/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9d0ded6b08a2a69c580b50759aaea86a1a154b90defabf60cd0943d25a4a46"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/loading_spinners/src/circular.rs: 0.0% line coverage (0/197)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loading_spinners/src/circular.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d0eb73decb3ed4c09733cbacf121aa017a4f1b204286d854b4c00854a61618"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/loading_spinners/src/easing.rs: 0.0% line coverage (0/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loading_spinners/src/easing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1927227ae13c71f03de85fedc0578230e3a4db27fda824aaf77502c0595f5959"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/loading_spinners/src/linear.rs: 0.0% line coverage (0/152)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loading_spinners/src/linear.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28456de3aabcb9419a7c1488f584f45898af19b88814db9f62e5dd040aba3679"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/loading_spinners/src/main.rs: 0.0% line coverage (0/58)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loading_spinners/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d952c2a5f069a9582c0a2e46c96afd037a93d9467ced8bbb00b4a126305a352b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/loupe/src/main.rs: 0.0% line coverage (0/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/loupe/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ae5062ca0e562526e5995021711e6f5b46690a03ad636f42e14e390db9f846"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/markdown/src/main.rs: 0.0% line coverage (0/219)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/markdown/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7929ae274a9af6e0df3de4ddefee70645e51bc1e68908a7cf387b31294970ba"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/modal/src/main.rs: 0.0% line coverage (0/120)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/modal/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec73d820bc084de788c259e4adcf9814467207ca0edbb10dc367309e2b5d4c08"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/multi_window/src/main.rs: 0.0% line coverage (0/113)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/multi_window/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f478e47b212e8949076f7ae60ea91fe12734da24db6d0240ea3de5d954c3b03c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/multitouch/src/main.rs: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/multitouch/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"801c92a10649b8357324f67493cf97685e7ca5035520674a27537b3d866ab1fd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/pane_grid/src/main.rs: 0.0% line coverage (0/242)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pane_grid/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d184a6c7ab1f82ea4c3410c168ac1bfbbf1426374f540145723e0d42f060f3fa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/pick_list/src/main.rs: 0.0% line coverage (0/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pick_list/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad07251379cc2afec5502cb4b1adf2d512daa432ed6725022a9d177982fb178"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/pokedex/src/main.rs: 0.0% line coverage (0/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pokedex/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4773b057f65eade2fa229fd80caa938cce6021d57e0a98fdff0e0c68a49a3e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/progress_bar/src/main.rs: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/progress_bar/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa8da9d6c5f46a461628e261d9312312ae58b0b3fc29e0b32a85d3417da1c38"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/qr_code/src/main.rs: 0.0% line coverage (0/64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/qr_code/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"713969869666a4450dcb1beaea4d42fdc0e927f37f92394ad122a3dad3caccb4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/sandpiles/src/main.rs: 0.0% line coverage (0/181)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sandpiles/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbfe890cc8469af189e62bfae43231d58f210a7d9447781eab8e05b9f5be980"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/screenshot/src/main.rs: 0.0% line coverage (0/178)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/screenshot/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c62bd0f53f66c03a2314d4d1881eaf9b5c79ddeef59602656c03cf7eb4d1f15"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/scrollable/src/main.rs: 0.0% line coverage (0/240)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scrollable/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71c5777dc054b3fc6332434ac448fec219ab8aa5bc74192498b00e7434cc42"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/sierpinski_triangle/src/main.rs: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sierpinski_triangle/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ff04165741250f595642f00d96bf29ffee5acb0ded04cc676f4b6b3e8427d1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/slider/src/main.rs: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/slider/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"233d2be28b2b0251eb763bfdab407c4939c422f6620f1c3dff95fc2a15401378"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/solar_system/src/main.rs: 0.0% line coverage (0/140)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/solar_system/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"088b536050765dc592b645a5eccb345fbc22c5156d65dc406485cb1a8093e9de"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/stopwatch/src/main.rs: 0.0% line coverage (0/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/stopwatch/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e665c00e759e5be22195d3e4d706aa7b5c8e0037629c4845dae93b9b000478"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/styling/src/main.rs: 0.0% line coverage (0/121)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/styling/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db31993bebdf2000895af10102d759076d7bf6d07cd5c949cc4e3115fcf35a5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/svg/src/main.rs: 0.0% line coverage (0/23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/svg/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34951d58f329a2e52d5cf3a5c7e4072b8aa6267d4e4ca02867c39f7e122d4d5d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/system_information/src/main.rs: 0.0% line coverage (0/72)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/system_information/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e8c6383243dc6de194b700f0216e5233fba30e4abdaf404591e683222e764"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/table/src/main.rs: 0.0% line coverage (0/187)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/table/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e55b7666259eb9a20e5d3a78439fd8c4c675c3d119d7c394bedc525d012189d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/text/src/main.rs: 0.0% line coverage (0/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/text/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3f758bb0d8c2eb7bc28f47954ffa3789ffe995b3058576e9f22d24a8d73a62"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/the_matrix/src/main.rs: 0.0% line coverage (0/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/the_matrix/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba769f8caf050bc4bd51c5e33d14f3b5b8b73da6776835c88b2c544b609ea0d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/toast/src/main.rs: 0.0% line coverage (0/132)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/toast/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd048a72106771b193e1b6c779cff5ccdf8718ed8fc5e659de8ee328c840c6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/todos/src/main.rs: 0.0% line coverage (0/331)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/todos/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4a0ef558fa5a5214b7e5fd391df39ebbfef976eba1f79c4c538941bec86a18"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/tour/src/main.rs: 0.0% line coverage (0/362)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/tour/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad78ef019e8e5826913c444a7a188300427de1bbeef69e9b91d39d02c4afa405"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/url_handler/src/main.rs: 0.0% line coverage (0/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/url_handler/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae41e1656887a46a0e59ca4d68760cf1b2040eb720f6baa5c8631fe050a3d52"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/vectorial_text/src/main.rs: 0.0% line coverage (0/99)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/vectorial_text/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddbccc7713cb37b009961456a52e97d49f764d9bbfa03231d176e93d3819492"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/websocket/src/echo.rs: 0.0% line coverage (0/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/websocket/src/echo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"448ce0407cc6de282614e49b989859723fd2a26d581b5b56c86a02ba16bf4df5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/websocket/src/echo/server.rs: 0.0% line coverage (0/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/websocket/src/echo/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8993a8aa13936cc82fc7ed2b7cd90367a2240f1c39ea0bb7d8f626a6fc0b57da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: examples/websocket/src/main.rs: 0.0% line coverage (0/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/websocket/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6642be571d8584ad889f6e37761157cbbecf10102eee2a9b59ad2d0a97be4526"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/backend/native/smol.rs: 0.0% line coverage (0/30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/backend/native/smol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4671712ad7a89a437c0a756ed7c86a4da3561d9139d474f298a1a5187ed67927"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/backend/native/thread_pool.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/backend/native/thread_pool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"394533ec911c8caf3b8c1785be443248c5f47d12d22cfb8e50919d47610cb15f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/backend/native/tokio.rs: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/backend/native/tokio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5326f37e0e5cbee45b9dc9667bf4ae55ef39650066db195e99b6f62fd8500ff8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/backend/null.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/backend/null.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbfa90caca5e99a63cebe7d97194e5d6278ff2636744f3e4e9a32bb9ad4fcf8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/event.rs: 0.0% line coverage (0/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/event.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf4669e24d2fb92092637c1bcff22b8500db7334e84bd7b86f54b1113266395"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/executor.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a067d0ab55dcfc8fdd09f5e0ceb6eb192825cb1beeff407ed6fa3528e7572f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/keyboard.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/keyboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f38ed0c4d08251a96cf261d724823bbd9e2beb9c18700814ddcfbd9ad2f854"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/lib.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"195e841a956cd43356ab63cd3770336627146297e0ea15effecde5ac2276075e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/runtime.rs: 0.0% line coverage (0/45)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa55f18a59eedc37a421354e6c920ee8131a1f9f405bbc36179a75b157b8d21"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/stream.rs: 0.0% line coverage (0/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbf1bb6e705fde4766753b326718a9b0abf65b30212217abd531d7b33998e54"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/subscription.rs: 0.0% line coverage (0/145)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/subscription.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a235f6a958d96e88b2248f629af788f8dbecdfcd75e6e6b53be95e4e1900a0cb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: futures/src/subscription/tracker.rs: 0.0% line coverage (0/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/subscription/tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81ffbc689e61edfc1fe8c98a433c8e006d04f83f40b314af3b7c81d3268631f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/antialiasing.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/antialiasing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91203511c6eceea3f0c88ebcd5ebda7359498ae98ffcfdbcc1c061528e791cc7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/cache.rs: 0.0% line coverage (0/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133cf4aafc73e4bd87d1c5c8e12789e3752c5cb4ba2ebf0746d853e7d364b9ba"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/color.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/color.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79463f86a913abf6042d5c070e66f83f7964a7da451430cc0db5eb35f3e85e4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/compositor.rs: 0.0% line coverage (0/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/compositor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08fcb1788899ffd305ea4ad67a04076cabc0cb837e7b7183293ac0d7721cbf2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/damage.rs: 0.0% line coverage (0/52)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/damage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06b794690abb288a78d736e163851af6ec8f7265631eb2254b02fb6ada65a3d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry.rs: 0.0% line coverage (0/2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0267f2370a915471cdfe7b4ad9aa4a7107faf105956821ebae5d66bbe166cb08"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/cache.rs: 0.0% line coverage (0/50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c05b324b84db0dd3358dd455ea6b79aca72c61898d4903c0d2022579e86637"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/fill.rs: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/fill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73fa2e0b7927da02f361983818675aa2fdd794048e2fc48375863d06b2b00bb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/frame.rs: 0.0% line coverage (0/122)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/frame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01b2d8b4ca784251bd4d1128060cc8e8c556d6087060eef8a99eebd1b93bc8c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/path.rs: 0.0% line coverage (0/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a32a6589db8bf833f988ee160559fa2154939089d55dfc457f0f8b29f6410b9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/path/arc.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/path/arc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a0da6c6a263ca5f1a1232249b612cee248d8e4c7884bf772aa31953e892bc6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/path/builder.rs: 0.0% line coverage (0/147)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/path/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6cd50e452f936937e22b3d7642462ab58dca50a166aca680a5de45c0510e0e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/stroke.rs: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/stroke.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c19aa05a38924b7ce57046dfc56173129181740e5345415e19fb56fb978b71"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/style.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0f56ee8d9caf29ff43a1423bb523f6644c9dfcab1ccb0cd9353c6eb4ee6315"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/geometry/text.rs: 0.0% line coverage (0/106)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f03927533aab34414e9607bee189debb76ea7678c0be5c0d19d7813ea2bc3a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/gradient.rs: 0.0% line coverage (0/87)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/gradient.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7036fff87aa88a67cf1db1ca9f66bec0e117dedd6ee521c4784f670a32f7f312"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/image.rs: 0.0% line coverage (0/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35e65cf69a4dcf46c6d5bd7d32e44683259e67177151781ac2ff94de1dbf770"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/mesh.rs: 0.0% line coverage (0/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/mesh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cf7fb4afa7a6787201258bddb70295a8f183710abab4445a501f1d457f35f9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/shell.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa7e6500bda312a8ac634d58a3c8c1287ab726719000e85846fbe1a808a8658"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/text.rs: 40.1% line coverage (95/237)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb28d71aaaa3a8ee44b1fb681c04f62404d7893edc089d27de028f0abff3f02a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/text/cache.rs: 4.3% line coverage (3/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b04916e804bbb805118cdae0196b43233b3d265c2b2253d4f473338a3d7127"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/text/editor.rs: 0.0% line coverage (0/706)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d810ee588f783deff2e65cf8a98e21725c6eb3a6d2034a6c4870ae60ffcf326"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/text/paragraph.rs: 48.1% line coverage (212/441)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abaa90fd56d8521bf90ddf31b5c88477cca9172de68765d84f0f7c6713e0d74"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: graphics/src/viewport.rs: 0.0% line coverage (0/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/viewport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4294881a3ae8957e0ca86350abe1495ff851459f3e887961aae441c862363"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: program/src/lib.rs: 0.0% line coverage (0/190)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"program/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b90508d7b65f4c3b8bfbc6ea8b4d033278907d5e333a4a2dda6289ef8ec390d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: program/src/preset.rs: 0.0% line coverage (0/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"program/src/preset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c8cd372d1e2de29e0382f8e6e7b49c77ebee7396c7f9dddad2a6e75ec3fe2c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: renderer/src/fallback.rs: 11.9% line coverage (40/336)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"renderer/src/fallback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c10a7e05b15bd1b8949a7ff3c4e8454f98e3984dfc3ab8de4f892218bc3b103"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/backend.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7517102a186211a4319126aadb179ca7443ec42dadb88a7f7171876a5670013"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/clipboard.rs: 0.0% line coverage (0/60)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/clipboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c397e09e06fdd66f06edc16fb97bf28f6078625900c5884c607e61866d2c3b5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/font.rs: 0.0% line coverage (0/27)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/font.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d84157c4c80b89aa540babb25394c7ab84e3baf5b0d058bb9791634470e4714"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/image.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce757dd20550f187b9a566c0c6b73f3ce63061da02144df8fa50a0d9bf5f6df8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/lib.rs: 0.0% line coverage (0/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ab5a3fcef3ceb8b59ab4c02e805e7cc5868cec05105c0c920a8068bad8bb2d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/system.rs: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc7886883f42fc230d268f3b4186d504564da6a2389cb7036bb572b749c705b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/task.rs: 0.0% line coverage (0/295)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d71e4403c34c2ea8e039c73f95b58d594e273b4572ec4b9f7add9f8c73925f0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/widget/operation.rs: 0.0% line coverage (0/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/widget/operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83b7446524a6188a5391fcf5237479957d8e3f0e6a8a5645c1d0de6502668c8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/widget/selector.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/widget/selector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397401dd67ca9b03c70d6b7724778b495e12c803df74d982b40750a267fd4a03"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: runtime/src/window.rs: 0.0% line coverage (0/162)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2104ab90d8f35249f5857cdf9fcc9301e25214b4956737153e97fa7609070c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: selector/src/lib.rs: 25.0% line coverage (20/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"selector/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"029de35afd9bb00de566662fde45caeac59569b878381c67dc2184d050425415"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: selector/src/target.rs: 9.6% line coverage (12/125)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"selector/src/target.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf823a0abb07001e7ccfcee7a130e1300a1042a6b3d0e73d3587a72dc0d00053"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/application.rs: 0.0% line coverage (0/473)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4557519973583c53cb35515d86f23026286406d8e38888df700f2a465ccd59"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/application/timed.rs: 0.0% line coverage (0/78)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/application/timed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed338db9aa5739396e3105de6e11bd42f59272a42f09425741db8a65163c8c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/daemon.rs: 0.0% line coverage (0/341)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daemon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6900db262cde4001c4cfd6dcdcc7a21acebb3c6d101dbd6268c11114b3cbc16c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/error.rs: 0.0% line coverage (0/7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dea73955afd46544b478c735472cb4705d6b3761d96222a413d7f5305e851c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/lib.rs: 18.8% line coverage (24/128)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce9f8274cc4d800626ff6e948d4bb46616bf1ffe78b5881f7d9d912723fed6f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/time.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/time.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675514dbe79143d249ffed20669bbc55878d3cec2ba2ce895509cdd9d47945fd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/window/icon.rs: 0.0% line coverage (0/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/window/icon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5408fe63271376d292de2cbed333bd1aa9016232521a888dd341e6958cc728"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tester/src/icon.rs: 0.0% line coverage (0/70)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/icon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"722a1d7e79260ac8f30c797c3eaac00adc52764391ed1a8f68b5ddde2ae2b8e7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tester/src/lib.rs: 0.0% line coverage (0/541)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d978aedcf3a1206115daeb28adf5ef83fbb283dc1fe1d45f8e288f21283dec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tester/src/recorder.rs: 0.0% line coverage (0/308)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/recorder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cebb29e4fd33180c4a674ec2519b5527fc45c1df1fab53cce915c2fd143775"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/engine.rs: 1.5% line coverage (9/591)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1ca9342e1e681eef6cd152db7a10d74b399f38dccc76aca6f19fc0ff3bc140"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/geometry.rs: 0.0% line coverage (0/315)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/geometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295b7501c6a96e1fbd2890d826d9b2382280fecca8c24b3d3337199ae960ecdb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/layer.rs: 18.6% line coverage (59/318)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/layer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5960a553e5316618b9cecc24ac6d31b46c3b44f144841c1ad8f391205111d4a7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/lib.rs: 19.1% line coverage (47/246)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb99a82597072e33ffb529d08592dfd37282e5ac0dc1d4585ce55b607e7a80"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/primitive.rs: 0.0% line coverage (0/11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/primitive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"241a5ddb79193501659979f0b0ed79d36ccbd02fc63bbf6b66c247e42cb2f256"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/raster.rs: 5.3% line coverage (5/94)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/raster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f4b90470417ae9085897a6616317e26833c43fb4fcc984938ae6b098cee6dc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/text.rs: 3.7% line coverage (9/246)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"531d49f9b8b2c7beee967f3f80c44ab9551bf836733d20c84f9096a61755b99a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/vector.rs: 3.7% line coverage (5/135)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee27655e24788dcc6268426f4b6f70f26f58279b99a3676a64b09635ff61f7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: tiny_skia/src/window/compositor.rs: 0.0% line coverage (0/165)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/window/compositor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b807df0070f92abbeeee1bdeb31e1052e461b7ebf5f9a1ea3e6e6d218c22a5e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/buffer.rs: 0.0% line coverage (0/79)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a460d42b449f4a775770ab84cb628985fb5912a3fc2f194c091dee00c27a4c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/color.rs: 0.0% line coverage (0/162)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/color.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be457597fb323ae272c2bdc26301eff4b79be2e6a820daaaaf80c1c5510509"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/engine.rs: 0.0% line coverage (0/40)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"039a67f4511527b8d412c9a6ff1cdec264b6e54ec05f999f3c22afad2adc0dd0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/geometry.rs: 0.0% line coverage (0/446)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/geometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc45f8d5828be363855d710736b14335bbc5b3267f7d4421d5949c10519051c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/atlas.rs: 0.0% line coverage (0/376)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/atlas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd9d458c8a819e6d8df2f774e7a9eaadf8d2e63e89975fd94fe2f3e4b779f81"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/atlas/allocation.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/atlas/allocation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da839b241e3b9240d0750774b8a4b4c659a6275a9f9722d90976bd7a668ba94"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/atlas/allocator.rs: 0.0% line coverage (0/61)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/atlas/allocator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1534aaaebe65287fd9f691a0e1550bd506a10e5cd29e175a6c2e87b73108e1d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/atlas/entry.rs: 0.0% line coverage (0/5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/atlas/entry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b687e3e5a0006de9810001e92955af312594def5596a244c29c752dc18637f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/atlas/layer.rs: 0.0% line coverage (0/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/atlas/layer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33e9e06ca085c45fb05e6e92d53476f5f73b3d984852f099ea28454307658e6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/cache.rs: 0.0% line coverage (0/367)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6162fc2405bd8fae099bb50567231b9257e20514ef25d1b13c8dd03e329b572e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/mod.rs: 0.0% line coverage (0/503)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0dfc28f4dc1f18228526b56e85b8ad21ad7fb5f44223ef6594d0f8dc79103a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/raster.rs: 0.0% line coverage (0/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/raster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56751f53e065b84af5f00025a655e268916146f0fcceb03aac007ec7b602c8d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/image/vector.rs: 0.0% line coverage (0/114)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c6c12e1ae34c1c3c7cf84d3690fe43669814a3642007adfd0172ece7b310a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/layer.rs: 0.0% line coverage (0/284)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/layer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7b9c7d7ce51346ac5a00ca0a8f211d14e280f49ceff64412c9451d76f2a351"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/lib.rs: 2.8% line coverage (18/650)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a9e28287aaeb1bb935766ac943148e37218bddde727d2738f58909da48b575"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/primitive.rs: 0.0% line coverage (0/82)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/primitive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2ee3eead024f1750b4263f329395a09d74fb91fecfa2bd6d9df8df09f79e19"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/quad.rs: 0.0% line coverage (0/198)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/quad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0fd0487acf5fa8a6678fdf8e506d8452f6e0fc56d4ac1dc5f4e488ade22870"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/quad/gradient.rs: 0.0% line coverage (0/129)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/quad/gradient.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8440f0f445a7a0889f301e85279f0a114d628181e9f9c4c19084b42b91688663"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/quad/solid.rs: 0.0% line coverage (0/114)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/quad/solid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861668097632a8ef03828a201a0f860398f41d4fd9f04000b3bda119c3207a2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/text.rs: 0.0% line coverage (0/418)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadb12a7d43f14819dffed1e630e82007068f5e6c27bc6999a7c47f5cffb0997"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/triangle.rs: 0.0% line coverage (0/612)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/triangle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0556d3dd77c2cac5c326fd368c829f095f7200c6dcb15dab1634b8b383a5956"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/triangle/msaa.rs: 0.0% line coverage (0/269)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/triangle/msaa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b26ecc14c4c8e51134b17a991b84bc6c455653a005a25bdfcc8a978551b83b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: wgpu/src/window/compositor.rs: 0.0% line coverage (0/266)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/window/compositor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b123db65face1632f53f107516fa761b55307b22df148011d3e03dce45a63f6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/action.rs: 28.6% line coverage (14/49)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/action.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87675150ddb674cf86eae98e7f30b705003b20a196fc43486d00f495d8fd4ec8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/button.rs: 42.1% line coverage (154/366)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/button.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d31cce01bf724208ffe121f4c4cf1314b7d07daf75d0c4ae6956b63ceaa409"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/canvas.rs: 0.0% line coverage (0/105)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fc8888658844a7213efa6cdafb9ffb7cbde71ab73ca67bb7856928fac7570d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/canvas/program.rs: 0.0% line coverage (0/44)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/canvas/program.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e915ca797cab3377e0f1add867272e6646f3226ad1919d368558494461d33456"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/checkbox.rs: 0.0% line coverage (0/394)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/checkbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1bb68fa24cd1fc7013407e265c466014762ebdb79ae4e5fd77403b9ba4c055"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/column.rs: 47.9% line coverage (173/361)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/column.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9de7dcc12caac84d6cfc9f49280aae879302763b342e4a6a32168e212e449b8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/combo_box.rs: 0.0% line coverage (0/446)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/combo_box.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bca3ec86c9e1f43e5449a219bf519454d165eec8bbad563ca1251b80afa1595"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/container.rs: 46.2% line coverage (159/344)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/container.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11e7e7f072a1684023a69b5afe368f9b04d6f29e5adde9334929ec5747faa6e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/float.rs: 0.0% line coverage (0/238)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/float.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2646d9c3e92c5a630da99e94a14cd5913040e43a4ff197995b16f9e45069af"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/grid.rs: 0.0% line coverage (0/227)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/grid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd49d4b8e4f10944a1bdd0ce4e42b456697229b53f30691b4b98cfd0002d4d44"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/helpers.rs: 17.7% line coverage (59/334)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399dcc25398b90449e893ceb79638b35ef2f552a39b19ef033d1fe6427cef5f7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/hover.rs: 0.0% line coverage (0/178)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7adf7da8560a77cbf346aaddb3452c4ada81dcc3fe823d780ea31d3c8581b45"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/image.rs: 0.0% line coverage (0/207)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9f1dd48dceca0308467f5d2ca9097da2c26332e00c2ab996acd928d7b488ce"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/image/viewer.rs: 0.0% line coverage (0/247)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/image/viewer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2ffe9db3d356cf0da9239d6f7558a7c0ac4c6043571644534c36fca419bb62"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/keyed/column.rs: 0.0% line coverage (0/209)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/keyed/column.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"368adc7ce85834c8c04616f9b9e726538e0af48efc3a45d21b906de69f2e61c7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/lib.rs: 0.0% line coverage (0/118)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fee6d5bb7fdc0909fd02ba77ecf183905d44e081595c00dd28957589b12100"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/mouse_area.rs: 0.0% line coverage (0/240)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/mouse_area.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0715d575906fdf46eda93eab91174257efe80d11be3ac297c73a6039ffb36a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/opaque.rs: 43.5% line coverage (47/108)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/opaque.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e991144a9b5d697995d19a21cad17f84e8bfc7f4d60f3b9e048cfc8b23e7c20"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/pane_grid.rs: 47.5% line coverage (348/733)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ad1902e4ce565762af1991cc8c073106363065e733c2a1cf64781df18527c5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/pane_grid/controls.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d6c1c0459ec8fbb80671a97d5659b7e6bbdf04ee53d925cf017e492ad61fe7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/pane_grid/node.rs: 38.5% line coverage (89/231)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61518313d89f8d71edb855372c66ba67774f4a040bc766b8987f6776a2f71fea"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/pane_grid/state.rs: 32.1% line coverage (72/224)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d0c8a1c9cfa6cbbe1d64afad178e0500762a6219b82a4e80eeee184aae8d6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/pane_grid/title_bar.rs: 38.0% line coverage (149/392)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid/title_bar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2768a09ec11e7e84f681a3d17fb3a3284454952168dd1a1ae6daa1717428555d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/pin.rs: 0.0% line coverage (0/129)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b981d1f9e9708aefcba27513065bd75943004003ad300a06568695e66a76383e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/progress_bar.rs: 0.0% line coverage (0/135)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/progress_bar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebec7547956d2c288f133e417370df8bcdfd435b9a3eeab265d10ea8ace74e7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/qr_code.rs: 0.0% line coverage (0/145)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/qr_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0af09f5f14996e959e5524cac0d4cc8332c45706e27aedabf272d746e89cdc5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/radio.rs: 0.0% line coverage (0/234)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/radio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07efa3d0230dc91d34a99edc39752b3153f9e253faab1b7082bcb9208c83b10"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/responsive.rs: 0.0% line coverage (0/98)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/responsive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7c96dd440482e6659b24cae536806cf2df993270e8372a092c479157c22335"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/row.rs: 35.8% line coverage (129/360)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/row.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5210438ca5804348383a18a51f59f8b80106ad6b01424d69f6d5f7d31276240"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/rule.rs: 0.0% line coverage (0/139)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/rule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1924563b380eba85361b9b12fda0dfcaef8eb83ce4d39b9323fd379b2f9cc0f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/sensor.rs: 0.0% line coverage (0/236)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/sensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc035911710031135edfba33e9228e58e476a32fa883b44ddcffa3c07774bfb2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/shader.rs: 0.0% line coverage (0/105)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/shader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d65e07aeba0cfdc47a622cabb83059fd6113bed4f5dbb06160e5bf41e6c8f7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/shader/program.rs: 0.0% line coverage (0/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/shader/program.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dab252b49e103082ffb7c7767f0876f5a8d61f6fa4c51020fd5c7650dbcb478"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/slider.rs: 0.0% line coverage (0/315)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de442d520db1dbc2fc650ea221378382e7a57764ca2973d508a75065593be490"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/stack.rs: 0.0% line coverage (0/228)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/stack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622de7b73faa99cb4e1b9b8ee15f436a1f7a04da3a001d4119a2828f9d13abc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/svg.rs: 0.0% line coverage (0/134)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/svg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da63075716284324ca5e5778b47658c7883e8e79b70d650b34b72b43f1728da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/table.rs: 0.0% line coverage (0/419)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d14ae2a6ea0f7e34bc74e4d6135db0123ba621ad3e50cc0a89284328fc6d4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/text/rich.rs: 0.0% line coverage (0/423)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/text/rich.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1effe6d7f8e7f8a22de9ad28b7d22a670f173024a69535f52ba6079f50ddbaa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/text_editor.rs: 0.0% line coverage (0/439)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/text_editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d42aeb82a6046898b3129b0cd8ded70a55c237800808004f33e4fa0de9019a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/text_input.rs: 0.0% line coverage (0/328)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/text_input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f825025e06c6e7666d0c26aa9826aa1399710ad630f7299becbff28a4b2035d8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/themer.rs: 0.0% line coverage (0/167)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/themer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeb6b57ced4ef3e61ac9ef97af75f39df553069217a9b696b35e11e268c4545"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/toggler.rs: 0.0% line coverage (0/300)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/toggler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac802964dd587c4925d02305e020b0875361cd6f9f8cde629b50dd12f646fcd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/transition.rs: 0.0% line coverage (0/242)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/transition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a99fb2ef9e8fd63f069c11aa92374fcc73d9439958aa0f7275e5c6dce9ff0da"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: widget/src/vertical_slider.rs: 0.0% line coverage (0/278)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/vertical_slider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eb6f3e72db03ccddb9567ebbaac4eaaeec4e1313f465ba4ce835f6675702ff"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/clipboard.rs: 0.0% line coverage (0/88)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/clipboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d205a256c05302dd11c74e37b8e397e0395bb4a7421071e9d21abe2c4fe7b4f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/conversion.rs: 0.0% line coverage (0/868)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a834dcc1489ecdc448d95eede8b0e496d208f1585c6378c6cb2a63ebffd445"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/error.rs: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc0021ca08c082ed9977a7bf2f6f5d52bc8a068d2f600b33ecf4d9da4da70a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/lib.rs: 0.0% line coverage (0/1277)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a582340c2c77338f8322f9a09cf8ee6a17367cda96dc72d50586fb975bef1b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/proxy.rs: 0.0% line coverage (0/80)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e596a38fe049cb010fa6ceac39088cc0fbece7b472b327b47ec80fd0a1bd7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/window.rs: 2.3% line coverage (8/347)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15337bf93c6071916b0e9b86321216ca77f216c837b68cc627de8c081f05abb6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: winit/src/window/state.rs: 0.0% line coverage (0/164)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/window/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a285cb6715bc67ed38f25a0bbc14162158a8ce9a0058e2bf0811e12684395eec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/markdown.rs: widget/src/markdown.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in iced_widget::markdown::parse_with at line 1075. 11 of those changes were fix/bug commits, and the other 36 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/markdown.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":"widget/src/markdown.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"7851e0f1d9b18f6a040e0372b9d50d0161163f410ac93807e21e17467e80bc25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/scrollable.rs: widget/src/scrollable.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in State::interact at line 2593. 2 of those changes were fix/bug commits, and the other 49 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/scrollable.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":"widget/src/scrollable.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec23591c59a3a88f4558104c9c825d19a5d45bae103e903c9fbbc0db0559acf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: winit/src/lib.rs: winit/src/lib.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in iced_winit::run_action at line 1288. 1 of those changes was a fix/bug commit, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- winit/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc6c48d419e1ea9a30ce964defa7796cb116a1c86cdfc4b9c8e312e51f46a92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: runtime/src/user_interface.rs: runtime/src/user_interface.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in UserInterface::update at line 198. 5 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- runtime/src/user_interface.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":"runtime/src/user_interface.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd3655595f9a5d99775e6179cb59c890966b6f9e36ca2738509d3b8cbe1ef95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/text/editor.rs: core/src/text/editor.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in State::update at line 330. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- core/src/text/editor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/editor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3606fe486f1c1c31eb4d5ce0a05370cae1c56198a0650cafd869bf74fde712e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/src/layout/flex.rs: core/src/layout/flex.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in iced_core::layout::flex::resolve at line 94. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- core/src/layout/flex.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":"core/src/layout/flex.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f458441c26e61ceff74abd8fd55a4f2da7597d4c30723cfe3bae5db9b5f486"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/text_editor.rs: widget/src/text_editor.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TextEditor::update at line 386. 2 of those changes were fix/bug commits, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/text_editor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/text_editor.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b32b63a5b5d197478b9d5cd0c7a20c6104267ab098f6a8047da5ba15275a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/pane_grid.rs: widget/src/pane_grid.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in PaneGrid::update at line 462. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/pane_grid.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":"widget/src/pane_grid.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcd20dd5940200b07916a4af0d2056c809138f9549a54bea253767524eb8736"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/text/rich.rs: widget/src/text/rich.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Rich::draw at line 263. 2 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/text/rich.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":"widget/src/text/rich.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86b567458bb258a33a4afe25efe1aee54ead932cc7dfacc22ea895759e33ce1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/table.rs: widget/src/table.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Table::layout at line 218. 1 of those changes was a fix/bug commit, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/table.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":"widget/src/table.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"219c5131ef93e8f9e5fabf4ddc59ff2bb7f691f29727d81cd03ff315accbd7ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/mouse_area.rs: widget/src/mouse_area.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in iced_widget::mouse_area::update at line 283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/mouse_area.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":"widget/src/mouse_area.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a20650c84e4a5d1ed3067ad5e2432b97404d0d89366bc647bd26dc565d503a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/vertical_slider.rs: widget/src/vertical_slider.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in VerticalSlider::update at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/vertical_slider.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":"widget/src/vertical_slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeffadbf2417fde30553c388f19b2683b4a40520167b1542f42e9d26bd69948"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/sensor.rs: widget/src/sensor.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Sensor::update at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/sensor.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":"widget/src/sensor.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ac345c935c2dfd343fc63ccdf1358b44585970d7318887831f58787907811c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: widget/src/slider.rs: widget/src/slider.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Slider::update at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- widget/src/slider.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":"widget/src/slider.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756a4122246814492db764d31b8ea25ef70306cf0aa0f6105365a721892f958"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: wgpu/src/image/mod.rs: wgpu/src/image/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in State::prepare at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- wgpu/src/image/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":"wgpu/src/image/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fda7ab882be70ab0c81ac8e8fce6f30e480367a0c8ad471b4d0a15ac0626376"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: core/src/layout/limits.rs: core/src/layout/limits.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Limits::width at line 63), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix \u0060Length::min\u0060 bounds inside \u0060scrollable\u0060\u201D; \u201CDisable \u0060infinite\u0060 flags for \u0060Length::Fixed\u0060\u201D; \u201CDisable \u0060infinite\u0060 for \u0060Fixed\u0060 and max-\u0060Bounded\u0060 lengths\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:16:37 \u002B01:00\u0027 --until=\u00272026-11-13 13:16:37 \u002B01:00\u0027 --full-history --no-merges -- core/src/layout/limits.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":"core/src/layout/limits.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"409cc5ca829de4a3baed1658e812f07782461f2cfd6e3e7182524ff1ffbb7471"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Wasm support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/clipboard.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9087de891acff0477d6d8fd8c374ca3f92cf3e6ca0ab3b1cef976b3a56ef0776"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix inconsistent API on Wasm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/conversion.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1532b0938ab6e6786a2509ed611eff27162a8f1d404acbf8cbad092fe49e1f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix inconsistent API on Wasm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/conversion.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b10f3f980f2ed50059af107e0ef0e2a10775b087d8744415b41db040290c846"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when unnecessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f993f27c3718353466255bdc5e9230ba84ee7d9273e7b0f7b5f32f9c70c08cd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK! Send a proxy event on completion to trigger \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d9220ef51c8cd85e445e71ed52bea9ff108e8c43850e986e947d6f7fc2c7c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send compositor through proxy (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd0e126dd3d43f57bafe734d54245bf6382d851e912d45f38236c07e09db047"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Shared image cache in compositor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc72d196605569d4c13ad57fda952d32af8d15383ca5b16c51d69c18710a833"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Mouse translation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/pane_grid.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"939ca9c7199ab6ca6857d96a32015b7719ba93ee55ab262524f3ce1819a61378"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fall back to \u0060Pointer\u0060 on Windows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/slider.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbf780252698ac6e2e88bccc43c317daac2135bb3c2a25733858b25f7b291af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fall back to \u0060Pointer\u0060 on Windows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"widget/src/vertical_slider.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3095ae0336ede5d1fe1b8363a56f5ab8e4c5c7a37733c4765f2e2a8cbb0c3c0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize AA pipelines lazily \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/engine.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc69618b4b2bfaf94246842b7cf72dc06703b99df2a9f4b9cbe8976766d5b110"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Centralize all the image feature handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3007f5727f0d18514684a440d0f3d01363856274147b4a3715e878400c9b83f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Resize belt smartly (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a49d6ebc037d608bd64618306f0430edacd0df41ae81f9b8101416875d3e8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Provide window id (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/lib.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec8cc0fc9c1bc3232ce68e8db4b83a38982b5fe57947d2ae4aa34a541f54702"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/cache.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c3f72092f3dd339949f8177f82c7c3336389ec7548f88fd9a91fbc4b98bab8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/cache.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a3cf39b7c31bc22b653d240d17cf7760f5963860a2cce1bad4f209ee17061c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/cache.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b26b03d82006c32685ceab782a3119ef465ad39acb3aa603f04d669fc761f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb79a38ca974931a6ec9f1db644545064fc611c791045ea32a1bf3c46dfc35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrent Wasm support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/cache.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1c43e50272d490aa57a804d6f31f4765a5c168ec36a5edd63194d930e35ea5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrent support for Wasm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/cache.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8179fa9deb5e17b0d74fe73372f95d5871a98ae54bed413deeb6920d507d1e67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Reuse \u0060cosmic-text\u0060 font database \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/vector.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb2ce11a7b92b5540839e5ba6d00850351fff81e13a59c133b1faf72eefe994"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Reuse \u0060cosmic-text\u0060 font database \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/vector.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c4a4f442f7367c5f5144674fdf3d8806e10fcdcb1e40e1cbb4d5de2d8d39c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/vector.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d619fd0ae6303e0ee95a97bc18b7cbaecc616dc7b2bac5a07f738bee4a7e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wgpu/src/image/vector.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eda0b1dd9544c10278ec10a1069b878fe37ea3c0499e8741326060aa8d8e56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Border radius \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/engine.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5378be492c25b617fca6998e1cf986866dae8ab6dc904d4ec4b1d1b98f48dacd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Honor layering! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/geometry.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"94580c3add7c014970978fa69434789a29bd7cee598fe20889edfc287f9f3ebe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Shared engine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7695b0794685b7659be59934bd7b5c16307869695049c052baaa0e323cd65d32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Shared engine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"717e57b3720586cb7e47b2a6d6381e75e3071ae8719195f10021a20da9e2715c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: No hinting supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e3bd53af8bfc4ff7a52506d3c98c796665b9a4b113e248e8e386fcb9a06271"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Outline support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c4d25df8212ea60ffd1f94d3247da3fb8daf2452a80ffcd9fc8a323ce39bb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Blend alpha \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5586d6219ff9b5cc02091ac29775cb20415fc7fae4846152918fadaa7ae43855"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Blend alpha \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tiny_skia/src/text.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"436bd10270e1fd61bc8a6fdce080a452ead2c667c84dff43405aaec08e44ad13"}},{"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":"tiny_skia/src/text.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b09d0677d2c747712a7aff2d9aad5b83ccf60619c40b7f3daf1b500eaaada65"}},{"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":"test/src/emulator.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a896bebf21e28ba3f53dedbd6c5ad78beac692e167968d4d46486a4489885c7"}},{"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":"test/src/emulator.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1343d60df961e2e5b7b0341cb57839e901e1f77ff683712a6af1b6d2e61ee6"}},{"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":"test/src/emulator.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"833a3d58a4a48caa27a1b690dbf9d53fc157377d4e6ec0c26eb6285b323b89db"}},{"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":"test/src/emulator.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dced8c75d10853a26e16ba05bebd3d9244980ef573b720ce7f1aae95bbdb0080"}},{"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":"test/src/emulator.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b8a1180c04e7041029cf6d906aa4bc38d2c9f31dd217f8e39aa7cfae04f39"}},{"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":"test/src/emulator.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab187cfa8047da85e3d34957ffe0a5020816e64343ff32c2b07e6ff6128985d"}},{"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":"test/src/emulator.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d545d4e92b1ef7db9b741475199ab054de96b667f5cc134022ded42db3557cf8"}},{"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":"test/src/emulator.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8114d3d86efc445ed31f7c37fa2d558efc9e32c5a414de02faa1f71433458fd4"}},{"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":"test/src/emulator.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fbbe0fa038bac9d5ffa9bc2d2ffc17f1ac9a2d5d5c4148ec586a8746f60b35"}},{"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":"test/src/ice.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c623d2cfcf17499e801810d4432e667f789d6be9bceed5e2cf651ea2abba9941"}},{"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":"test/src/ice.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2581685945bb7604fc243e89718c98182ad5e8d9cb15e55ac3ae8c1479b6d08"}},{"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":"core/src/text/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b4bc8e0a14a03f701b24b9bc683c88d174d4b2df448d1aba413b2cc503cb24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ellipsize? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tester/src/lib.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"c317f256f4e21b017e26d7c2f451f7d2460ffe3d4dd67e70bcc9b28f687691ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Error handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/src/emulator.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d1f24591f108b3c000d6666d2dfefaf4569d492ea49b7e16b5d9d9c56ea4ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Error handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/compositor.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c23bab3981e67c37979dc99bdf6d973c4d195061876665ed53052520c3f1cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Nested redraws! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/src/emulator.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5751a6995888dd045a8add6796003bf50c84967c38dd3c3c98f9880a2bc40a8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Concurrent runtimes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/src/lib.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6514db800840e5276fcbdbec5ce7c2678e0b7509ce891c36a8d5cc16526f2a12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There is no proper way to compare raw buffers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8959dd65f19be6f0e74fa25fc4e700f9fc028bd4665844b67ec8644c765659de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid relayout with some changes to \u0060cosmic-text\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":"graphics/src/text.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"928c1da1f2a4628022f6207c6710cc3951e7144ad1a8b8b0da12a64f6d7d1820"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix hinting in \u0060cosmic-text\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":"graphics/src/text.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ed6735023f8fc9fc66f24ebcb0cfe53421d9a1a2e54f4eacc02665dfb86362"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle multiple strong references somehow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc8ccf097aab9b26d5c73616a3f2d9fd9c6c2e783ecb775f507eb409cc200eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expose \u0060Affinity\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":"graphics/src/text/editor.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde12381bec7a8174c923f2c1adb06f0b04d635f86342bf8421969d3710718ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Configurable! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/editor.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac69c40a33d7b50cccbcacf106b376f1042b0a76fa598bff2204e624e3f519"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make it pure instead of side-effect-based (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/geometry/path.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b194afe9ffa9455926f285a16cdad29d7b35c6273c1538368684883f4567f36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Raster image support for \u0060Canvas\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":"graphics/src/geometry/text.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a989cb8a12ccbcc6c3f005dfa62d08a095f9ba4f67fd90859a0c5f9151c617"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use bus if/when it supports async \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"futures/src/subscription/tracker.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"19743bceff553aa277378f91433cfefa58c0286eead17c08cf771d2a03381adb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Run concurrently (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"devtools/src/time_machine.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"406ec8ce8f649cfef2552745ef1da728eb38804149788c318836fde725a94326"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expose duration getter in \u0060lilt\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":"core/src/animation.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3716460107a287539f4f7af86831db9edc1347a42675b403bfb498e614e535b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add image variant \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/background.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6b70326fac063f803c70533392e80e9ce258e3761855021d5ba13222f96360"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Merge loop with extend logic (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/tree.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"477eaa43d4f7b0d7f16e27f0c648764c8bc957a410071d33f4e0df7c038751c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Merge loop with extend logic (?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/tree.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad19b38501e1592bc3a1e82144e23740b8efa541c44a9a0339c7260b6ed24459"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make immutable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/widget/operation/text.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f7ea1c66048d2bdea39d825dee8ec4a336bbee18134edf68cd0467b1823259"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make immutable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/paragraph.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a010fc87f71d73ce422fb88afacaaeb48c6754943a49f32e8bdfeb44d90afee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Compute factor from relative contrast value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/theme/palette.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d6eb3a3967cd9d4152f0bff1cf4dd5a9cdc78b59e90d5629b0a6fcdf0692c0"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: Best effort \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/highlighter.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"79644bddbe0a0184e6fa5325117ebb97b89c1258b0864e5d1a7f69342d5a9300"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get rid of cursor argument in \u0060draw\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":"core/src/overlay/group.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6f9045482f567101d7a91a0ce289b29e6d2a9185fefd9deb1ea4c03f2c6d92"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 17 project(s) overshoot their size bounds, lowering Project Cohesion to 7.6/10. The most over is \u0060widget\u0060 (28257 LoC, 195 module-visible types across 8 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0616f42d15318a389fa9f05aebf9f72bbf32f859e928e87b56dabc68f77c18be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f30490c9104b32941d222332016d17ba2b145df0c195f025b353ec611910f070"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"13f7d139c0eab4b6ddc5cae740cc8309832d2129ed9b7751480800f5eb5bf298"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea648b307ddef6d1bab65989caed20b6c6c9f254977e89e3ce6f25e5e84c32d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"effca76f4b986339ca6fc548b9783ebf05f717bca68cffc5f903ebb6ce983bac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"dda956a13cdce539dd0f713b2b9872dbdc0e419f62ee3adc9733f2c9c6eb7871"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e10dd1c37af22b497f72f89b2c46e91ef5c8fc9d8d3b51a11f187eb59b3d5d0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15ad88b38fff2e6e26a2e5c51db46b5d95f5a0ab9ae8764a426454804472d49b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4fb8958a9bd551f4ab927f6e6f0ab6922f9e3f25076d9fa45a5e1bf730709b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c26c5f75ea0fd93b15b1903b3a0dc9471fe5d588ef18c2a919d73b88e120389"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"045562b35b2b2c227e5b0cdf3d286d2cf31f63072d8abf407d04a8619cd89e10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3de55e66c098276be7df1850b698a729cb3723698672ee4b36b7eb0d1e9d3747"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c2a92042fb220acafb3fd6c5138a13c3ca03d51df0a9ea9c17e81e70744755d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e72a7bfe5aa8ffa265daff19f772638b3b186b5b7776b43ea9fa8d0db11550b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1e4de35ac3f687d06bdcc1f7ef6aa68ffb37e3296e1466e150dc1af8f92652f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"223291cef22cfb56296c24d878d1027a1a1b9b9d99262531e72c31e0cb115194"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66e03d73e5a8837f3f9d7497063f281f0f5e19ce72cb63769228820053343dcd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"57d56a96e6a66cc71a03a3dd00907661a2a0e261f64b2bd3be9d7d1abec59f07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"238a9b7eb220bae36e8ba10c00bad14a9ecaab5ed8684814680b22d375b70a77"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"511ad4733f7179e4baa02b842c664230eea1441c4db257cfead3eb0af204599f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac19b5d6d5396a0751fdb89436c870f558a40f6920ad7b730c3720a00e2376a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb37432032ea69e8a8accd75ea75a9674b4b60292f3ddc75d4fc185d15ac99c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c34a077357dd899e55eb69d26b062b0cf0823cc3efbd2f9c06ceeada9d8f3f03"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bba784a07a43195ce938bb0b9ef6a93043b24782dec8a4bfaf6b0b7a0ee32ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5cc992ebcbb66c38d3b27470258e72e4f86e9ebae64a3644adfde11e223cced"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b39c129b1855bbd407538cd2d423f8216e14c6af9a1bf9e4f09f63654722cfdb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8914b576a8783f5e491389e2c024a3797b402af4aa957d192282818c8a97883"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"651e3ff2659ac5105b7bc3a7ba3749b5c7248338bf1741acc8f38bff809d972e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88326e7a86d59fe089f6db0edbc51f30bee4509f98ea7605bd489deaa926aa42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd9f50710cb60127ca777458dc29bb34b9809b0ee4de726931674ae5af296cd4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31024484bb6e25622465a687434feb9aed2cf11ae686378987a3a5e1fa622a61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05fa7dab32f6310db0bbaf2e9cf80a080932640f048e355e7336a00cfbd026a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a3b876a21506bc5210a204a24c34b6527aeeee1f1c36deb097f6dbaf0541cae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e86b9bdaf8658c20dc540e5ce1218153d4015929345f56729d9c6663789143b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d885a6c3524cf72fd5a2ed03e9e79b3e2b2b4c2a38e5f00b3f7bb7e4044b710"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.1","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.5","advisory":"RUSTSEC-2026-0371","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.15.1","advisory":"RUSTSEC-2026-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.1","advisory":"RUSTSEC-2026-0372","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: damage.rs \u2194 layer.rs: \u0060graphics/src/damage.rs\u0060 (context graphics) and \u0060wgpu/src/layer.rs\u0060 (context wgpu) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00605467c19c\u0060 Replace \u0060Primitive::Translate\u0060 with \u0060Transform\u0060; \u0060b7b457a5\u0060 Make \u0060shadow\u0060 optional in \u0060renderer::Quad\u0060; \u0060603832e6\u0060 Introduce \u0060RawText\u0060 to \u0060Primitive\u0060 in \u0060iced_graphics\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/damage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8f4ce47c033320e3122a09528286de002d00c42497f49849bb0e25e4fd0369"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cache.rs \u2194 paragraph.rs: \u0060graphics/src/text/cache.rs\u0060 and \u0060graphics/src/text/paragraph.rs\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00607b3ec152\u0060 Update \u0060cosmic-text\u0060 to \u00600.19\u0060; \u00601354cc1b\u0060 Add \u0060Ellipsis\u0060 support :tada:; \u0060439f4e32\u0060 Update \u0060cosmic-text\u0060 to \u00600.15\u0060 :tada: \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4a6611303d52e6c5eb1bd6adb532c0af4fe97bf59fdf232cf9c82364cdd5b4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: paragraph.rs \u2194 text_input.rs: \u0060core/src/text/paragraph.rs\u0060 and \u0060widget/src/text_input.rs\u0060 change together 57% of the time (12 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00604ef3b1d3\u0060 Drop the \u0060Font\u0060 generic in favor of the concrete \u0060Font\u0060 type; \u0060836a93a1\u0060 Draft \u0060is_secure\u0060 support for new \u0060text::Input\u0060 abstraction; \u00601354cc1b\u0060 Add \u0060Ellipsis\u0060 support :tada: \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/src/text/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebbbb16cebce2507a1453842de3d118067f98bf55481840ac620c906cc2596a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cache.rs \u2194 editor.rs: \u0060graphics/src/text/cache.rs\u0060 and \u0060graphics/src/text/editor.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00607b3ec152\u0060 Update \u0060cosmic-text\u0060 to \u00600.19\u0060; \u0060439f4e32\u0060 Update \u0060cosmic-text\u0060 to \u00600.15\u0060 :tada:; \u00606bf6fc60\u0060 Update \u0060cosmic-text\u0060 to \u00600.14\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphics/src/text/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"303239b9e797c77e8118b65eb9e66c5db9d4f03ff33e9763957007e75f6cb61b"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b389a9e5c5eac2d0e9ba73d76bd681640d09a163b992edff11d010a596b2d1dc"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"171a5915161e926e35d9f9302156f7a2c57d16c96d5bdd1af3f21e2d4308269b"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ecf2657495604baa12d27f500fa18b0f02b6afd1b0af27ba8bfb79b5cc9b17c"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9044faa9594d327018de93b2313c72f6088d41c08f65abe12c4b92f1374053c"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"318bbb3992e518b8d03be785b994dc874459af06685b2f8afa054c431ff36b02"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3602e3230d82fb9d1f03db29baff358a65fd735b14907054a6a8f1e398d007e"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bee16a916192bc47803c755fa5c777c01a15fb56e69ce46b43bdf718adcb77fa"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060iced_debug.internal\u0060 is marked as implementation by its own namespace, folder or name: \u0060Span\u0060 (debug/src/lib.rs:309, \u0060internal\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debug/src/lib.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d31d073e138bcda5d7beb3b2ac23c5923ed731859544349896d9e14d0bcd6f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 11/12 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run_instance\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51b5dad35e1f546d1a976f641e46473a8f3ed27b6b20da89e1c43ad8125b968"}},{"ruleId":"X1","level":"error","message":{"text":"\u0060block_on\u0060 inside an \u0060async\u0060 body: This runs a future to completion from inside an \u0060async\u0060 body, which is already being polled by an executor. tokio\u0027s \u0060Runtime::block_on\u0060 and \u0060Handle::block_on\u0060 panic (\u0022Cannot start a runtime from within a runtime\u0022), and \u0060futures::executor::block_on\u0060 parks the worker thread on a future that may need that very thread to make progress \u2014 a deadlock. The future can simply be awaited here: \u0060fut.await\u0060. Where a synchronous function in between forces the bridge, make that function \u0060async\u0060 too, or run the bridge off the executor with \u0060tokio::task::spawn_blocking(move || handle.block_on(fut)).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"winit/src/lib.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1171845da9fe346ba164bf90bfcdf355da1ed40f1423e19a2013bec9a541182"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.width \u003C 1.0 || bounds.height \u003C 1.0\u0060 appears character-identically in 2 files \u2014 wgpu/src/image/mod.rs, widget/src/canvas.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":"wgpu/src/image/mod.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a030907f540d4287b1e87da7e86e9bd07ad3bfbb0109ec22dd3dffc8507cbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060physical_size.width == 0 || physical_size.height == 0\u0060 appears character-identically in 2 files \u2014 winit/src/lib.rs, winit/src/window.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":"winit/src/lib.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56f967a96a020e8a696564c1e7b075354bc4e33a9582af20e1ed75c0c591074"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.width.is_fit() || self.height.is_fit()\u0060 appears character-identically in 3 files \u2014 widget/src/column.rs, widget/src/keyed/column.rs, widget/src/row.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":"widget/src/column.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e1cfb4a540e3c6c67907d3c39928f0ac8a0e010c54e6839a517213562703dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.keyboard_modifiers.control() \u0026\u0026 cursor.is_over(layout.bounds())\u0060 appears character-identically in 2 files \u2014 widget/src/slider.rs, widget/src/vertical_slider.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":"widget/src/slider.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"319fe8505847f41e3f96193176a194b16518b296a83552e5298fbb08e2eadadb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060style.background.is_some() || style.border.width \u003E 0.0 || style.shadow.color.a \u003E 0.0\u0060 appears character-identically in 2 files \u2014 widget/src/button.rs, widget/src/container.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":"widget/src/button.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1661324cf912d156fcea541ab10c4c7a5e13a92d50d9c13a7afd21e45bb6a"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":49,"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."]}]}