{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"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":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"Application::window_event (cyclomatic 168): Application::window_event has cyclomatic complexity 168 (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":"frontends/rioterm/src/application.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb11cdb5c57cb2e81d7c3e6c452a99ec15e21a59b12bf72f846de5a9dc6c2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode (cyclomatic 160): rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode has cyclomatic complexity 160 (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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c165ac94e37420e4ed0f28619cc046ed5c83a6486eccf36fa018766e27ff68"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_window::platform_impl::windows::event_loop::public_window_callback_inner (cyclomatic 157): rio_window::platform_impl::windows::event_loop::public_window_callback_inner has cyclomatic complexity 157 (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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea397a3b4b33a025d7fe4e127afb458f5cef10a2208d7f49a10d3ac0fd6b8702"}},{"ruleId":"D1","level":"warning","message":{"text":"Application::user_event (cyclomatic 149): Application::user_event has cyclomatic complexity 149 (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":"frontends/rioterm/src/application.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"180011fae7781378f010a77a66d5dd18a6acbe7ae7956ba102368cb430a9953c"}},{"ruleId":"D1","level":"warning","message":{"text":"Performer::csi_dispatch (cyclomatic 87): Performer::csi_dispatch has cyclomatic complexity 87 (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: rio_vt::performer::handler::get_termcap_capability (cyclomatic 273) 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":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"252db33513f8460ec2d73dc32ff930efac33da3a6c4a62f911e3b9dd8922fc43"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen::process_key_bindings (cyclomatic 84): Screen::process_key_bindings has cyclomatic complexity 84 (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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ca3de489d6ad2a591a449260c73460808488c72389db469597520409c59778"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_grid::build_row_fg (cyclomatic 80): rio_grid::build_row_fg has cyclomatic complexity 80 (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":"rio-grid/src/lib.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19ebace34c48661ffbe46fc8041f5d3fa45676ff01c91bd74c07aa356bfaed6"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_vt::ansi::kitty_graphics_protocol::create_graphic_data (cyclomatic 56): rio_vt::ansi::kitty_graphics_protocol::create_graphic_data 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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c10f40be56906beb2997f53225a097399393bbc0bcc2e6ab414b5836e1c733"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen::render (cyclomatic 53): Screen::render has cyclomatic complexity 53 (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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":3877}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0a767603d64a21d46d81f9a354cc80d9ad046c03018f1c79b999c122649e5"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::sprite::box_drawing::lc (cyclomatic 53): sugarloaf::sprite::box_drawing::lc has cyclomatic complexity 53 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: sugarloaf::sprite::box_drawing::draw (cyclomatic 129) 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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1967b3837a3a653ab82c9f5052e87ee64ad0f3cef2f6e306a9f4ead50a270009"}},{"ruleId":"D1","level":"warning","message":{"text":"Grid::shrink_columns (cyclomatic 50): Grid::shrink_columns has cyclomatic complexity 50 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/resize.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bda90458cd3d6fac0f2293e4d40b57f8a7dcc358240e67f25dd79b343ce099"}},{"ruleId":"D1","level":"warning","message":{"text":"Performer::osc_dispatch (cyclomatic 47): Performer::osc_dispatch has cyclomatic complexity 47 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rio_vt::performer::handler::get_termcap_capability (cyclomatic 273) 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":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b81af244aa4577c9c2b6a73bb803e4de2d9181f53074866daed7e26f768f47"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_vt::ansi::kitty_graphics_protocol::parse_control_data (cyclomatic 46): rio_vt::ansi::kitty_graphics_protocol::parse_control_data has cyclomatic complexity 46 (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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd63c5124f1fdcde4989b9d17df757f974144b24442ec3aec548d2ed95f0838"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::overwrite_with_platform_config (cyclomatic 41): Config::overwrite_with_platform_config has cyclomatic complexity 41 (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":"rio-backend/src/config/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5927587a33847d76068a11546b1aec92a92658a68914a33477b6ce24a8652f"}},{"ruleId":"D1","level":"warning","message":{"text":"EventProcessor::process_xevent (cyclomatic 41): EventProcessor::process_xevent has cyclomatic complexity 41 (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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d8834116e9d38c177299dc8efb8388e9de8de2beda3536c89676ff95e53e73"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::run (cyclomatic 40): Renderer::run has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e76aee4be0a4f9fc328b60a435382aac16afb526bb5d311dae7e010b7d60c8"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::renderer::cpu::render_cpu (cyclomatic 37): sugarloaf::renderer::cpu::render_cpu has cyclomatic complexity 37 (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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29818bfa960c1ac1fc81b726b443417644f7ecf934888b7fd904859eaaaa6cd"}},{"ruleId":"D1","level":"warning","message":{"text":"librio::capi::rio_surface_key (cyclomatic 34): librio::capi::rio_surface_key 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":"librio/src/capi.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eeb9d06f8374613c89afa757b1c354254e7d622ab887b01fd2515737f1bac4"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_vt::ansi::kitty_graphics_protocol::parse (cyclomatic 34): rio_vt::ansi::kitty_graphics_protocol::parse 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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93abb8fb8432bc8fd057d9c37ac42efed287ecf012e4b07e995aa487fbe23f3"}},{"ruleId":"D1","level":"warning","message":{"text":"WinitState::event (cyclomatic 34): WinitState::event 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":"rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab13837dd1f639da2f48d955ed5f2a7ff4fa230309ece02eeeb250602cbf509e"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render (cyclomatic 34): Renderer::render 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c46ca3df5c45badb4ec02feea82c6d236a309af31ef51f16f3d3958a025106"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::renderer::cpu::draw_quad_instance (cyclomatic 34): sugarloaf::renderer::cpu::draw_quad_instance 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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b950717925e19ed032f4359254759ea26eac40e6f860ca8d5d2f41852e685d"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen::handle_island_click (cyclomatic 33): Screen::handle_island_click has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca897acd0b300e12b258e836b5492e48c5065246b0e2eef56585db803368081"}},{"ruleId":"D1","level":"warning","message":{"text":"Grid::grow_columns (cyclomatic 33): Grid::grow_columns has cyclomatic complexity 33 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/resize.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b6e909a5d699e3a7565f8e51ccedca891f51c028fdbadd2bc2d3447e1c782d"}},{"ruleId":"D1","level":"warning","message":{"text":"UnownedWindow::new (cyclomatic 33): UnownedWindow::new has cyclomatic complexity 33 (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":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"47181841b6cacd16dd434a13ef0791c041e133cd1613b8ebec1fa2f7ba22f1c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Route::has_key_wait (cyclomatic 31): Route::has_key_wait 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":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3352ae64b5bdeda232f3f4a2dd8683da4e5b4fddfffbb98f06d1d484d2ed68d4"}},{"ruleId":"D1","level":"warning","message":{"text":"SequenceBuilder::try_build_control_char_or_mod (cyclomatic 30): SequenceBuilder::try_build_control_char_or_mod has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: SequenceBuilder::try_build_named_kitty (cyclomatic 42) 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":"frontends/rioterm/src/bindings/kitty_keyboard.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"848e9cc957edc324e5a952af96dd1d4384b72ed05d7f94ed733c8fbb6c966a85"}},{"ruleId":"D1","level":"warning","message":{"text":"Island::render (cyclomatic 30): Island::render 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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f1f9921e5c8abdc7388f42f1853fe0d843993c4decb3a539d5ab93c676ebc8"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyEventBuilder::process_message (cyclomatic 29): KeyEventBuilder::process_message has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rio_window::platform_impl::windows::keyboard::scancode_to_physicalkey (cyclomatic 160) 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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4324eef3233084dd5cbd31e8c1ac61e5a21cb22e6f019a8a15b12bcdda4a45"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_window::platform_impl::macos::window_delegate::new_window (cyclomatic 29): rio_window::platform_impl::macos::window_delegate::new_window has cyclomatic complexity 29 (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":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"089abb3b3e9560aa971e0d7364f5776699fd3d62037544ace88bee0c5de42122"}},{"ruleId":"D1","level":"warning","message":{"text":"ViModeCursor::motion (cyclomatic 28): ViModeCursor::motion has cyclomatic complexity 28 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/vi_mode.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c0c8f6874f07445e9dd429ef476fdee705a5bd0467b0a0dbcfd01a2b2277dd"}},{"ruleId":"D1","level":"warning","message":{"text":"TrailCursor::tick (cyclomatic 27): TrailCursor::tick 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":"frontends/rioterm/src/renderer/trail_cursor.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5962fee9b3b8b13b8f7fe95835176b95cc4605589907f2923efa89de2d83818d"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutCache::prepare_layout (cyclomatic 27): LayoutCache::prepare_layout 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. This is NOT this file\u0027s highest cyclomatic complexity: rio_window::platform_impl::windows::keyboard_layout::keycode_to_vkey (cyclomatic 196) 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":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f353f9be0b23a62f22549f84a0dd53ea7d5c2915038c5dd5cee7a70ca276c"}},{"ruleId":"D1","level":"warning","message":{"text":"libsugarloaf::capi::sl_render_surface (cyclomatic 26): libsugarloaf::capi::sl_render_surface 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":"libsugarloaf/src/capi.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"31156c09e03e6bc19cadd9dce3be232981d5a91de534085d996145d80fc4d157"}},{"ruleId":"D1","level":"warning","message":{"text":"teletypewriter::unix::terminfo_exists (cyclomatic 26): teletypewriter::unix::terminfo_exists 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":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f7c815bf42cf775c2a51cb69a3a9b74e314c3931b3f87bff610e7c9a183cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"rioterm::context::title::update_title (cyclomatic 25): rioterm::context::title::update_title has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/context/title.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"049d8573c3f349630629c07363459d41e8b5d5aedeeb6d9aa7933711970c2c32"}},{"ruleId":"D1","level":"warning","message":{"text":"ActiveEventLoop::register (cyclomatic 25): ActiveEventLoop::register has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/event_loop/window_target.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e986943c7b80af7f0f17e2dc782ade765b9c8ef182c2ef8029369bead51d18"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render_graphic_overlays (cyclomatic 24): Renderer::render_graphic_overlays 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1dd96b29991e190c0a68c1f57ab7a5ae286abf243718568bc90a9941921204"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen::process_key_event (cyclomatic 23): Screen::process_key_event has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Screen::execute_palette_action (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c306d1887e5534254411c32fe0e16a072bd67f96f5b94359aca08ef92cf2ea58"}},{"ruleId":"D1","level":"warning","message":{"text":"Machine::run (cyclomatic 23): Machine::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2754546d649692d568d38981daceeb46835e7e3490d75a9174be84bf3d716a"}},{"ruleId":"D1","level":"warning","message":{"text":"WinitState::pointer_frame (cyclomatic 23): WinitState::pointer_frame 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":"rio-window/src/platform_impl/linux/wayland/seat/pointer/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ced287765e428cb81f73c9935cc1c1caf6dedea61ad210dc25c8760a68e4197"}},{"ruleId":"D1","level":"warning","message":{"text":"EventLoop::single_iteration (cyclomatic 21): EventLoop::single_iteration 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":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf97de2228690a3ced482897eab0c13f76adad264e0bc124ff12fa053ca931c"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowFlags::apply_diff (cyclomatic 21): WindowFlags::apply_diff 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":"rio-window/src/platform_impl/windows/window_state.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1ec94c8287a7be22c71f3b7f0e4e1701a7f19890d60daa1edc38e853009348"}},{"ruleId":"D1","level":"warning","message":{"text":"FontLibraryData::load (cyclomatic 20): FontLibraryData::load 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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a0ed4ffd36d2cd7766d9e2c9253e739a6e4553fa9dfe8338a100e96114cc4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render_metal (cyclomatic 20): Renderer::render_metal 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbcc0cd0419968169e2ba813dc6b380839da77fdb025125fd36707777f157c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Surface::serialize (cyclomatic 19): Surface::serialize has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"librio/src/lib.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64d57e87019c5ca97649c8eb794bb65efe9a6d8b374ad317a3795a9b6cfb174"}},{"ruleId":"D1","level":"warning","message":{"text":"Performer::process_apc_buffer (cyclomatic 19): Performer::process_apc_buffer has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rio_vt::performer::handler::get_termcap_capability (cyclomatic 273) 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":"rio-vt/src/performer/handler.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5b76e38aafe11aacc7c06018cd3a65d2a71bed0e1439fc3b8212d55cdfbe02"}},{"ruleId":"D1","level":"warning","message":{"text":"Machine::pty_read (cyclomatic 19): Machine::pty_read has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b423a6432fc4d1407e4a59267e12ec13bab8748aea202a3a494f87445c73ec"}},{"ruleId":"D1","level":"warning","message":{"text":"EventLoop::run (cyclomatic 19): EventLoop::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rio_window::platform_impl::orbital::event_loop::convert_scancode (cyclomatic 94) 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":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"594869684a769f2db2d25830f46fba34059f2c83b05a47f01fe57a9a5fa27195"}},{"ruleId":"D1","level":"warning","message":{"text":"Shared::set_listener (cyclomatic 19): Shared::set_listener has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/event_loop/runner.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"268ff7a307fb50132e3358c66dab9b513ca3ef966dcbc6b6c525fd75a5b341c9"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowDelegate::set_fullscreen (cyclomatic 19): WindowDelegate::set_fullscreen has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5f48c106d22e49f2c304fb3387a74aae308307ad9ba829f99d24aff4c99ad"}},{"ruleId":"D1","level":"warning","message":{"text":"librio::key::encode_legacy (cyclomatic 18): librio::key::encode_legacy has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: librio::key::kitty_codepoint (cyclomatic 25) 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":"librio/src/key.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4192bb271a6991e53dc7f90cd33865b100f41d538705d022343c294ee6d37357"}},{"ruleId":"D1","level":"warning","message":{"text":"librio::key::encode (cyclomatic 18): librio::key::encode has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: librio::key::kitty_codepoint (cyclomatic 25) 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":"librio/src/key.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"18df09a838eb4f02c033eab7762891d5044a902a2c6eb9fed658339dedb11f81"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_vt::crosswords::formatter::write_sgr (cyclomatic 18): rio_vt::crosswords::formatter::write_sgr has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/formatter.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d20a9a742c317a0fa971d5a894bda7f644551d2eadaab2b3107d325e759e135"}},{"ruleId":"D1","level":"warning","message":{"text":"EventLoop::process_event (cyclomatic 18): EventLoop::process_event has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rio_window::platform_impl::orbital::event_loop::convert_scancode (cyclomatic 94) 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":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac59f017440ef1c86599e6baf9dfb1f92813331cf23394e42f98a8bb7e3c1e0e"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_window::platform_impl::windows::event_loop::handle_raw_input (cyclomatic 18): rio_window::platform_impl::windows::event_loop::handle_raw_input 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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5b6a1c778cb359a9b137dc35ebbff4c33f670be7e0549c55f321614eaecad5"}},{"ruleId":"D1","level":"warning","message":{"text":"MetalRenderer::render (cyclomatic 18): MetalRenderer::render 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"108b2c76af391f8846851e90907c996b5aef966f070586b6f66ced185c9839df"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphicData::resized (cyclomatic 17): GraphicData::resized 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":"rio-graphics/src/lib.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b705e93ee62d25fec9ccb8bc4bd987b51e511de72b1a88fe94b251d54cd25e"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_grid::rasterize_decoration (cyclomatic 17): rio_grid::rasterize_decoration has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-grid/src/lib.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ca940eb753765bc5a0aa5072c12d25ada25ebe8142b58440286d8f4df991d"}},{"ruleId":"D1","level":"warning","message":{"text":"Graphics::evict_images (cyclomatic 17): Graphics::evict_images has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"527fd9295ab1d645b845017cb7e607ad1de51f94d667a9b2a3cd2d68c7c98813"}},{"ruleId":"D1","level":"warning","message":{"text":"EventLoop::single_iteration (cyclomatic 17): EventLoop::single_iteration 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":"rio-window/src/platform_impl/linux/x11/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e6c54a21ae6bc5f8bdc16960dfedf88c63280109be921f86c3b6617fdc4798"}},{"ruleId":"D1","level":"warning","message":{"text":"WgpuContext::new (cyclomatic 17): WgpuContext::new 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":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"36736d6cb62a0e12740d659f46a0cc78bf5acfb0e29aa66a362fab1cde6b8835"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCache::process_atlases (cyclomatic 17): ImageCache::process_atlases 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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"103439d1796b81562f1442fdc461ce7001dbb91541af4b70097e80fb6a2ae7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::font::lookup_for_font_match (cyclomatic 17): sugarloaf::font::lookup_for_font_match 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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"536064e8d618a5c6b769dc0b4841bbe562c2d58e1d2b3e108dff4060cd535b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::font::linux::discover_fallback (cyclomatic 17): sugarloaf::font::linux::discover_fallback 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":"sugarloaf/src/font/linux.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adf82c7b60065ff91bf9b6a7e7be784088e6d2155f050b584f8a57b5f15a249"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandPalette::render (cyclomatic 16): CommandPalette::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":"frontends/rioterm/src/renderer/command_palette.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bd00be7f40ef8885f592ee090227a465288164bc910a58ad95731362a707a6"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphicData::compute_display_dimensions (cyclomatic 16): GraphicData::compute_display_dimensions has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-graphics/src/lib.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee8fb830364eb639c353910d7536db3a1d6b2dc5549f16bbe06cd85548bb35"}},{"ruleId":"D1","level":"warning","message":{"text":"rio_grid::row_hints_for (cyclomatic 16): rio_grid::row_hints_for 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":"rio-grid/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f5968fcc5b052bb0895f9bfa291514d0cd4934ae70dacc96fd4523a9b11100"}},{"ruleId":"D1","level":"warning","message":{"text":"Selection::rotate (cyclomatic 16): Selection::rotate 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":"rio-vt/src/selection.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aca376cb1ed8e90be7071e11a38f8971034c258e864b98d9c3018fe958ad4a"}},{"ruleId":"D1","level":"warning","message":{"text":"EventProcessor::client_message (cyclomatic 16): EventProcessor::client_message 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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"438c1d2a1a1e31cde2296e90ae4cc21b9c048d32b7a1ba60463fc2faa803ed02"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowFlags::to_window_styles (cyclomatic 16): WindowFlags::to_window_styles 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":"rio-window/src/platform_impl/windows/window_state.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4b1dc404e1ca901e63e78ddd12cb83e491b288dc099ac4697d71489f1d298a"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::query (cyclomatic 16): Database::query has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/loader.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f21d995603133b10b49057a3771893482cf6379ff123c64a2dd8d35cca9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::font::loader::find_best_match (cyclomatic 16): sugarloaf::font::loader::find_best_match has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/loader.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb68276b5f61e60213e4467e07b43e71fec53cbd59977b83230421682f98a53e"}},{"ruleId":"D1","level":"warning","message":{"text":"sugarloaf::sprite::braille::draw (cyclomatic 16): sugarloaf::sprite::braille::draw 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":"sugarloaf/src/sprite/braille.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd6a15135e6137615ad1aea45db708916beff5636bc9c39b423921520ce8646"}},{"ruleId":"D2","level":"warning","message":{"text":"Application::window_event (cognitive 339): Application::window_event has cognitive complexity 339 (threshold 15). Drivers by points: if/else 106 (266 pts), match/switch 18 (46 pts), boolean chains 27 (nesting depth added 188). 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":"frontends/rioterm/src/application.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"642bfd089bc3e287ea1fe73d853e4cae007f6889afee5c01c51ff48874989631"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_window::platform_impl::windows::event_loop::public_window_callback_inner (cognitive 263): rio_window::platform_impl::windows::event_loop::public_window_callback_inner has cognitive complexity 263 (threshold 15). Drivers by points: if/else 86 (202 pts), match/switch 17 (42 pts), loops 4 (10 pts), boolean chains 9 (nesting depth added 147). 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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc21ee0086d9e8462e86d3e4bafd14d25c6cfe5d958fbea61e92a81fd8f9d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Application::user_event (cognitive 253): Application::user_event has cognitive complexity 253 (threshold 15). Drivers by points: if/else 88 (216 pts), match/switch 6 (17 pts), loops 4 (11 pts), boolean chains 9 (nesting depth added 146). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/application.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6f024e77bb4e838a3a8ed29fe0c15869a18f6b8e9c7b6ea96c57141aff709a"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::build_row_fg (cognitive 216): rio_grid::build_row_fg has cognitive complexity 216 (threshold 15). Drivers by points: if/else 69 (187 pts), boolean chains 15, loops 6 (12 pts), match/switch 1 (2 pts) (nesting depth added 125). 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":"rio-grid/src/lib.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6f31eac7d4d49ece062735cd23779db8f435d47a3a9697c366525428a81709"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::shrink_columns (cognitive 127): Grid::shrink_columns has cognitive complexity 127 (threshold 15). Drivers by points: if/else 34 (85 pts), loops 6 (24 pts), boolean chains 15, match/switch 1 (3 pts) (nesting depth added 71). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/resize.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c1363d111a46b4477b078bebe13bcc5a2105692981fe0662266a5244a6ef08"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::render (cognitive 105): Screen::render has cognitive complexity 105 (threshold 15). Drivers by points: if/else 43 (72 pts), loops 8 (16 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 43). 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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":3877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a040195239133a5594ecbdd88a200697fc336b2a599e28691d887eaa2baf6a65"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::run (cognitive 103): Renderer::run has cognitive complexity 103 (threshold 15). Drivers by points: if/else 32 (81 pts), loops 7 (15 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 59). 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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f626f3cdfb3584912c378085581e605542c22304a77a6038684edddf7e626463"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::ansi::kitty_graphics_protocol::create_graphic_data (cognitive 100): rio_vt::ansi::kitty_graphics_protocol::create_graphic_data has cognitive complexity 100 (threshold 15). Drivers by points: if/else 38 (72 pts), boolean chains 10, loops 3 (9 pts), match/switch 6 (9 pts) (nesting depth added 43). 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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e83e2338ed248865f247afc7aee78d28b1b860460a852f14f4c528667170e49"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render (cognitive 88): Renderer::render has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (67 pts), loops 3 (8 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 53). 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f47d1dbf358ee17e72025cb68452f1cea93a5ef9a2f0e530c24c0eb4a7b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::renderer::cpu::render_cpu (cognitive 76): sugarloaf::renderer::cpu::render_cpu has cognitive complexity 76 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 7 (10 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 38). 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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"88eff07dc0b65f69df20e45c035c9f705690ad6437ea9c5cc22bbe9660e2d7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::sprite::box_drawing::lc (cognitive 72): sugarloaf::sprite::box_drawing::lc has cognitive complexity 72 (threshold 15). Drivers by points: if/else 40 (52 pts), boolean chains 16, match/switch 4 (nesting depth added 12). 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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e6df0f8c59d22312c6570b46226229dd07434cc05f5cf91d881a25a5e34c19"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::renderer::cpu::draw_quad_instance (cognitive 66): sugarloaf::renderer::cpu::draw_quad_instance has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (47 pts), loops 5 (13 pts), boolean chains 6 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6febaf24dbb3f9d79ad6748c42638db4f556a48bdbe8b3d778df864fd1e618f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Island::render (cognitive 62): Island::render has cognitive complexity 62 (threshold 15). Drivers by points: if/else 28 (52 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a31c311cb2eb4224acbfd79fab38b6aa77e958ea36733f396ebd14ccea5b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::ansi::kitty_graphics_protocol::parse (cognitive 60): rio_vt::ansi::kitty_graphics_protocol::parse has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (45 pts), match/switch 5 (10 pts), boolean chains 4, loops 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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5adc973b6fd0deb44552e4a472090b405a07d2228c6567284fb48b67849f2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCache::prepare_layout (cognitive 59): LayoutCache::prepare_layout has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (40 pts), match/switch 4 (9 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 33). 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":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c5ab18afb11717793db3fac8e2c7cd51ab8a96a68779e54d7ee790ac182d19"}},{"ruleId":"D2","level":"warning","message":{"text":"Performer::osc_dispatch (cognitive 58): Performer::osc_dispatch has cognitive complexity 58 (threshold 15). Drivers by points: match/switch 11 (22 pts), if/else 10 (19 pts), loops 6 (15 pts), boolean chains 2 (nesting depth added 29). Of this number, 55 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae0b7ee9f43988bde3d2c1ebdbfcd6ec7234e266aff85345931ae06fd041553"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::grow_columns (cognitive 57): Grid::grow_columns has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (45 pts), boolean chains 8, loops 2, match/switch 1 (2 pts) (nesting depth added 24). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/resize.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3a1b4b454cc740c0928964e89a77dfd1e2d9ef6bd8255df0e2fe26e69a80e8"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyEventBuilder::process_message (cognitive 54): KeyEventBuilder::process_message has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0e46ab225d2e74cf646d35ed625abb0d69ea596a08adf7eb8a9c6eb911b1de"}},{"ruleId":"D2","level":"warning","message":{"text":"libsugarloaf::capi::sl_render_surface (cognitive 50): libsugarloaf::capi::sl_render_surface has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libsugarloaf/src/capi.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f99f8b21f7c7bc968e77ef10026b86d52bc8f9e6c99c159e3ec2204e99fd40"}},{"ruleId":"D2","level":"warning","message":{"text":"Machine::run (cognitive 50): Machine::run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (36 pts), match/switch 2 (6 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22019f6237d1b5c7235ed5e489cf009ca7ee63694b2eb2b8f09c8e406b856fb"}},{"ruleId":"D2","level":"warning","message":{"text":"WinitState::event (cognitive 49): WinitState::event has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 14 (23 pts), boolean chains 1 (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":"rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f12ab64031cb6af7d17e99a8df7efe7d5613e2e90d3ba62122703cd2eba505"}},{"ruleId":"D2","level":"warning","message":{"text":"Performer::csi_dispatch (cognitive 48): Performer::csi_dispatch has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 12 (21 pts), if/else 8 (15 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"772f1b82176aa6496366e793fcc96cde4928eaaf6db0387bbfa74c0a36ab91ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::handle_island_click (cognitive 47): Screen::handle_island_click has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 7 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"182deefce7739e525f3d1875482248ea12203c930fff8611c25127fe932e9052"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextGrid::collapse_single_child_containers (cognitive 46): ContextGrid::collapse_single_child_containers has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (33 pts), match/switch 2 (7 pts), loops 3 (6 pts) (nesting depth added 32). 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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cda5f1f92384db69ef46284f5b021b9bb09e51a5b7e586708cabbe3ca02e670"}},{"ruleId":"D2","level":"warning","message":{"text":"rioterm::context::title::update_title (cognitive 46): rioterm::context::title::update_title has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/context/title.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"785fe1351cb425f9acc67b1f24cd2ee32c3aa1a58461f49b9447d7cd5a199135"}},{"ruleId":"D2","level":"warning","message":{"text":"Surface::serialize (cognitive 46): Surface::serialize has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 6 (13 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"librio/src/lib.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dee2097a8c1ab805b88d9a9c1937f49c1fcc793d1d126f8a6c1fe65f035cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::process_key_bindings (cognitive 45): Screen::process_key_bindings has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"681ad07b6f8f1c41aa68e168996a8184b6b31fd57d880c07d8e9dcf80af976fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Route::has_key_wait (cognitive 44): Route::has_key_wait has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 4 (11 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d700aa003ecb7d07f14218f88e5689a42de7f4f795ba64db2dc4ccae85f239"}},{"ruleId":"D2","level":"warning","message":{"text":"Performer::process_apc_buffer (cognitive 44): Performer::process_apc_buffer has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/handler.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd649254065509489f273ea404c7058b2e1ab0a78f8d406e079865d4c261748b"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::overwrite_with_platform_config (cognitive 43): Config::overwrite_with_platform_config has cognitive complexity 43 (threshold 15). Drivers by points: if/else 40 (43 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-backend/src/config/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8abceed61f7bc302748a3160550b7a710334dbfbeca98ad7ed34e3368b52444"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::ansi::kitty_graphics_protocol::parse_control_data (cognitive 42): rio_vt::ansi::kitty_graphics_protocol::parse_control_data has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 10 (33 pts), if/else 3 (7 pts), loops 2 (nesting depth added 27). 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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9f711ff6831def34eb76a97fd7829598bd341057597f4ad04b250295a843b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextGrid::walk_separators (cognitive 41): ContextGrid::walk_separators has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 5 (12 pts), loops 3 (5 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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bf01608e65d55edbbf85acaaeb1ca6a628d4834631ea8c2aa5536afc99be1e"}},{"ruleId":"D2","level":"warning","message":{"text":"EventLoop::run (cognitive 41): EventLoop::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 8 (18 pts), match/switch 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7abd1bed857ad6e7f8a02fce0e1d1f5760708a380ae5f8338f6e55b7369965"}},{"ruleId":"D2","level":"warning","message":{"text":"FontLibraryData::load (cognitive 40): FontLibraryData::load has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 4 (6 pts), match/switch 3 (6 pts) (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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d212792813479f79757e0bb958b280b2c58a1168d019fc036657b9d48c7a30"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render_graphic_overlays (cognitive 40): Renderer::render_graphic_overlays has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f2f87e471f5613118530ceec257e21229f6990d5a78280196025a6a553e506"}},{"ruleId":"D2","level":"warning","message":{"text":"TrailCursor::tick (cognitive 39): TrailCursor::tick has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 11, loops 3 (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":"frontends/rioterm/src/renderer/trail_cursor.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9853c5235816ad29a4ddb9fbd5ab42e16fe486255ce372644e1d6543168a2a48"}},{"ruleId":"D2","level":"warning","message":{"text":"UnownedWindow::new (cognitive 38): UnownedWindow::new has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26 (31 pts), match/switch 4, loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"be619dcf3fd7652875a0fd91f2af8de29bc346a985fd02ae55a4a4b8eb4677c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Poll::poll1 (cognitive 37): Poll::poll1 has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (32 pts), match/switch 1 (3 pts), loops 1 (2 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":"corcovado/src/poll.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269733fc734c382b9c784aabf24cc3e0abf7338bf094dffdbc7e172a0168e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalRenderer::render (cognitive 37): MetalRenderer::render has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccab0e670535213ef4f1919886b14cb6860ebfe086b9104c3108ee79aff5a48"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::process_key_event (cognitive 36): Screen::process_key_event has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (27 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). 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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d68ca6e2e53c792dcf949a0d1c3eead76c1c760071e8431a8229be010aacf8"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::try_load (cognitive 36): Config::try_load has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 5 (15 pts), boolean chains 1 (nesting depth added 25). 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":"rio-backend/src/config/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecdde39e07e6ad7ab4f71221eb7b46084f523333ef6a9734a91af78b9df6d41"}},{"ruleId":"D2","level":"warning","message":{"text":"EventProcessor::process_xevent (cognitive 36): EventProcessor::process_xevent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 6 (14 pts), boolean chains 1 (nesting depth added 19). 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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd993ec0eedcff3e87273e3fb0ee1bb61dcf2292691a52d045e4b01599b81d"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::loader::find_font_path_from_data (cognitive 35): sugarloaf::font::loader::find_font_path_from_data has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 3 (6 pts), match/switch 1 (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":"sugarloaf/src/font/loader.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2f60285216e8e478a817d0607814643ef6bd1707ad2e53b1677e48f65aeda4"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_window::platform_impl::macos::window_delegate::new_window (cognitive 34): rio_window::platform_impl::macos::window_delegate::new_window has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (24 pts), match/switch 4 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10a159218af73d595dd45b8541819a0deb6525bed653a4e85a0583a5fd20af3"}},{"ruleId":"D2","level":"warning","message":{"text":"WinitState::pointer_frame (cognitive 33): WinitState::pointer_frame has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/seat/pointer/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2726324f2332793d23a279462ccbc16fdffa6bacc8b793303405e8f8e9b9496a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCache::process_atlases (cognitive 33): ImageCache::process_atlases has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 20). 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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9728e22677b78247a7aca853fc1c36f450fe84af74caf5ee0c2be9b89160c92"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render_metal (cognitive 33): Renderer::render_metal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b52eaa7904e45f6ea2a5b7f47170738d55f58295937583b59d2d2e0b4f992"}},{"ruleId":"D2","level":"warning","message":{"text":"EventLoop::single_iteration (cognitive 32): EventLoop::single_iteration has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 6, match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9077e6d1b653ac9dee128bb6320a0c6d22be6f6df9f078544d9620e5723f0b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadinessQueue::poll (cognitive 31): ReadinessQueue::poll has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/poll.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7ebe084bef19969aca235b32661db1863ed01daff515277e93411079016c9"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPalette::render (cognitive 31): CommandPalette::render has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (29 pts), loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/command_palette.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52297645fc2812ecfeb647a1fe4b57d8db85cb22e804393c725a8b01bd9190a"}},{"ruleId":"D2","level":"warning","message":{"text":"teletypewriter::unix::terminfo_exists (cognitive 31): teletypewriter::unix::terminfo_exists has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e605592f0dae350cea2f6801f889789a81061728c714e0efca0a508eab399d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"EventProcessor::client_message (cognitive 30): EventProcessor::client_message has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 1 (4 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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b691771131a18ae850572ad57ee04baf8bc654d5352d4fe7d2fcca72d672fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_window::platform_impl::windows::event_loop::handle_raw_input (cognitive 30): rio_window::platform_impl::windows::event_loop::handle_raw_input has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"a976a0daf4451d2183481ba1103b1b0d8cbba71a24b89f02f3a8a4ee071b9e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::scroll (cognitive 29): Screen::scroll has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"625f165743cc24dbd28a444038f8bb199eb96be1101779efccbe83610a759622"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::push_virtual_placeholder_overlays (cognitive 27): Renderer::push_virtual_placeholder_overlays has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (6 pts), loops 2 (3 pts) (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"26765d50724197beec2e1c2c73a6da94bee676ce0e0b5440800efead45b4b836"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::update_hint_state (cognitive 27): Screen::update_hint_state has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":4933}}}],"partialFingerprints":{"codehealthFindingId/v1":"67abab880900e7e87c44b83da510d0423994a3e729e92cabebb8804e9585c05c"}},{"ruleId":"D2","level":"warning","message":{"text":"Crosswords::format_vt (cognitive 27): Crosswords::format_vt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/formatter.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab397f33d80da8cb7967a2f646f5ea20ef5dc1d6bce71e3dc62fbdc6848f8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Shared::set_listener (cognitive 27): Shared::set_listener has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 1 (2 pts) (nesting depth added 7). 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":"rio-window/src/platform_impl/web/event_loop/runner.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"761032238ad525a0e0cbd6c2b3c1550fb90a1e48f1d063cbcd03cdf971930d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowFlags::apply_diff (cognitive 27): WindowFlags::apply_diff has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 7). 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":"rio-window/src/platform_impl/windows/window_state.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"456cfde941c116273e3064feed4d0ce292a445fabb96e0e9cc665bbb2b6ec073"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalLine::extract (cognitive 26): LogicalLine::extract has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (9 pts), boolean chains 4 (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":"frontends/rioterm/src/hints.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"15554a4532f47f403c6d1c22467d5ff6b9c13849fd891a08d305db5d5f77d65f"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderState::collect_virtual_runs (cognitive 26): RenderState::collect_virtual_runs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"librio/src/render_state.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"363727b0fffa28ed880d0e07e3d182071e0643a4f4c592b609bfaf4cbe6ded08"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveEventLoop::register (cognitive 26): ActiveEventLoop::register has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 13. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/event_loop/window_target.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a91408fa356a991ea6c94e82f2563378b49c61fe746e7f29bd93ad1c3380b24"}},{"ruleId":"D2","level":"warning","message":{"text":"Graphics::evict_images (cognitive 25): Graphics::evict_images has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5, match/switch 3 (5 pts) (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a887f728568dc8e1354cadc51adbce5e0e8ead24cccb0a453b916f8d71b31ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"EventProcessor::configure_notify (cognitive 25): EventProcessor::configure_notify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1b8c5123c50d3476bd76f12b885769f814806acd83209bdda220837ba4d91e"}},{"ruleId":"D2","level":"warning","message":{"text":"EventLoop::single_iteration (cognitive 25): EventLoop::single_iteration has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6b55abbefde2fae24bccc8af4d839654b49eade6bdd159e013198bc276a11e"}},{"ruleId":"D2","level":"warning","message":{"text":"WinitView::update_modifiers (cognitive 25): WinitView::update_modifiers has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/view.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c224ccdd3c68131c50c1f4f44c4bd821547312a612fdb439ca485fde04c98bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"WgpuContext::new (cognitive 25): WgpuContext::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (10 pts), loops 1 (2 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":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6647bd62e78516ebaad18571249a81d041856ff3048a2b1e85baeb7e98657602"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::lookup_for_font_match (cognitive 25): sugarloaf::font::lookup_for_font_match has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e7d5bf2c1b38ce0bb58274e4e3a4389bcd6a3bde841e4d0a3ad408c3f5ad25"}},{"ruleId":"D2","level":"warning","message":{"text":"Surface::url_at (cognitive 24): Surface::url_at has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (5 pts), boolean chains 3, 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":"librio/src/lib.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfbf2b87e38253f72dc59a41e2678fb082cfdd025dbfbafc12399ee91880556"}},{"ruleId":"D2","level":"warning","message":{"text":"VulkanGridRenderer::render_text (cognitive 24): VulkanGridRenderer::render_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 pts), match/switch 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"630896ba653751da6dadd2482b97e9f300b4cbc5fd33c38c5b1f0fcad7e6854b"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::find_font (cognitive 24): sugarloaf::font::find_font has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 4 (8 pts) (nesting depth added 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. 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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a71b905df3f1e314c6a4106040c9b73fd31479285884386dd9ef35db13d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::renderer::image_cache::colr_raster::first_base_glyph_id (cognitive 24): sugarloaf::renderer::image_cache::colr_raster::first_base_glyph_id has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/colr_raster.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeacaa5ab37174bd9c92c7d4b47339344072160882b93c12da6617f747552c45"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::linux::discover_fallback (cognitive 24): sugarloaf::font::linux::discover_fallback has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/linux.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c7447f8054a7275d755a32846258638c30b4576dc5bb35858b6a29f1b6b754"}},{"ruleId":"D2","level":"warning","message":{"text":"Island::render_color_picker (cognitive 23): Island::render_color_picker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b8560664105caf8e213ddcdf235014a812457d4895bd87476b2038ab725c96"}},{"ruleId":"D2","level":"warning","message":{"text":"librio::key::encode (cognitive 23): librio::key::encode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5 (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":"librio/src/key.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"5166ce65e91e92d4062aa3d5d2ee64c9733ee7653fb9ae9c0196ecf973c56d16"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::row_hints_for (cognitive 23): rio_grid::row_hints_for has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-grid/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce58c06ea86c58f51cf307b1c8e57fb52487890ac9fbb2edf2ea10959038de9"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::rasterize_decoration (cognitive 23): rio_grid::rasterize_decoration has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 1 (3 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-grid/src/lib.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7033d58f19420a91e3c219fe54c206a1dabb05c6fcdd45c90b5bd08df8d4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Machine::pty_read (cognitive 23): Machine::pty_read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 5, 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":"rio-vt/src/performer/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec95d9fb5cdd07f0b547c22729b186475a4765f6bf6770899fdafd07555de84"}},{"ruleId":"D2","level":"warning","message":{"text":"Selection::rotate (cognitive 23): Selection::rotate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6 (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":"rio-vt/src/selection.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c5e8c26bc29bfbd480cdf66b44f96d0ad3ac3ce078dd6502e1bcaec3601f55"}},{"ruleId":"D2","level":"warning","message":{"text":"EventProcessor::xinput_key_input (cognitive 23): EventProcessor::xinput_key_input has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bdd68606277c27ebc29f4d5e3ca04762e5c068e3da08c2b5852341b3abd2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchOverlay::render (cognitive 22): SearchOverlay::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 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":"frontends/rioterm/src/renderer/search.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7dc66e6439a2c79eb5706b43f90d16228c0139b60d2078f48b2b914a9f60a9"}},{"ruleId":"D2","level":"warning","message":{"text":"librio::key::encode_legacy (cognitive 22): librio::key::encode_legacy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, 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":"librio/src/key.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5ddc1f298ff10c37a4f5f2a06a77c110e7b22e937e8a813b5e8e424a5b9d67"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowDelegate::set_fullscreen (cognitive 22): WindowDelegate::set_fullscreen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ae2c12b6388da51135a789c5e912e830271d5294d6e8e6c24b319ac8f43ded"}},{"ruleId":"D2","level":"warning","message":{"text":"FiltersBrush::update_filters (cognitive 22): FiltersBrush::update_filters has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 4, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/components/filters/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"65008ce4fe0b06665a4dc64db7fd7e36cdd14d0966a4ef7cf00a9e78c176674c"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextGrid::find_horizontal_neighbors (cognitive 21): ContextGrid::find_horizontal_neighbors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ContextGrid::find_vertical_neighbors) 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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c20dcac571acfc8094d54be36174ddaf73a39b45470552d1ce9beac132af33"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextGrid::find_vertical_neighbors (cognitive 21): ContextGrid::find_vertical_neighbors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ContextGrid::find_horizontal_neighbors) 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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f636875cfc18372c5884bd8b36a86d2cfd5814910d2c894c2eb1fe0f68a72f"}},{"ruleId":"D2","level":"warning","message":{"text":"FontCache::pre_populate (cognitive 21): FontCache::pre_populate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (5 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/font_cache.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"26813a349c55aa78a4c584a83bfa02418113536349144551cf3c1abc2fc4adf1"}},{"ruleId":"D2","level":"warning","message":{"text":"List::fill_cube (cognitive 21): List::fill_cube has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 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":"rio-vt/src/config/colors/term.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"76213fd1b77e3b49baaf550b1cc011d250617dedafcec570b461ec1ed565c934"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::grapheme_lut::cluster_width (cognitive 21): rio_vt::grapheme_lut::cluster_width has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/grapheme_lut.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"359fdf51adf7e9a7dadcda785f56faaf381c6ed24d4a50dde9cc002e8912bf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCache::allocate (cognitive 21): ImageCache::allocate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab46f92666972119fff731c34865ce428af84ff2b16e02b60a3c74715dc69ada"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector::register (cognitive 20): Selector::register has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/sys/unix/kqueue.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefbec369c67ce28e21fc3b51d32e1e589f96063fd6c2f056a7da4a5780bc1d6"}},{"ruleId":"D2","level":"warning","message":{"text":"HintState::find_hyperlink_matches (cognitive 20): HintState::find_hyperlink_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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":"frontends/rioterm/src/hints.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eb38771b73d014b92569599f0398a3d1af6b0b73c00ef7256e8d53c07a1f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalLine::match_at (cognitive 20): LogicalLine::match_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/hints.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a171c877755b750ee9438809cbbc6ac7d04560f7ab66bb110aef07fd8f9f4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"List::fill_named (cognitive 20): List::fill_named has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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":"rio-vt/src/config/colors/term.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8173a9e5660831a1a2827960023336302d34b1ee2e8c7a8bb9739c6a0f3a6da6"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_window::platform_impl::macos::event::create_key_event (cognitive 20): rio_window::platform_impl::macos::event::create_key_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/event.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e496a9cd4ae42cdb2becc14cc0edc6e43939b7ea7d32ed69260ba906d9cfa7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::renderer::cpu::draw_glyph (cognitive 20): sugarloaf::renderer::cpu::draw_glyph has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"d277d0cf39f01aaf96f85cae8d892b66f94d8fed7b9a22308c958e2f78ee0467"}},{"ruleId":"D2","level":"warning","message":{"text":"teletypewriter::unix::create_pty_with_spawn (cognitive 20): teletypewriter::unix::create_pty_with_spawn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (4 pts), match/switch 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":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce834ab6b66959b32fcc6b804ecf515d7196dd9af91a0afbe9678e892e03859c"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistrationInner::update (cognitive 19): RegistrationInner::update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/poll.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a5ed107124982ab6fe0fa63436660b95ad6dc206a67a7fbbc57826ac0505ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::find_hint_at_point (cognitive 19): Screen::find_hint_at_point has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb429559cd8725a78d3cc82e16465f597722cb76634d0d33535bc34f992cd52"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::build_row_bg (cognitive 19): rio_grid::build_row_bg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). 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":"rio-grid/src/lib.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5031013e293850c9c684780e7e21ecd2fab8f3e705729b4aaa633d57f06b41a"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuGridRenderer::render_text (cognitive 19): CpuGridRenderer::render_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"636d0fba35af52a1d728a91d43ecbe0ef43c12134aa769e418449aa11af78c23"}},{"ruleId":"D2","level":"warning","message":{"text":"SequenceBuilder::try_build_textual (cognitive 18): SequenceBuilder::try_build_textual has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, match/switch 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":"frontends/rioterm/src/bindings/kitty_keyboard.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd19c780e55ea87add8525581a19c0ff63f742fbd9f1cc160f48942d54760f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::set_ime_preedit (cognitive 18): Screen::set_ime_preedit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0439fdf35f751c5f4ee2c1db76fbd9230b0ed140477d8f51a5a0529b9ecb5800"}},{"ruleId":"D2","level":"warning","message":{"text":"Surface::scroll_wheel (cognitive 18): Surface::scroll_wheel has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (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":"librio/src/lib.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f70fee96bc3f3340278ba562e3bd277a6f756483922c87c578bbfe7090064"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::ground_dispatch (cognitive 18): Parser::ground_dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b218925f190a8cce4f845a272df3a1c2cf195c2b687683e47acd1ac36b8a3dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::ansi::iterm2_image_protocol::param_values (cognitive 18): rio_vt::ansi::iterm2_image_protocol::param_values has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/iterm2_image_protocol.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9603c584341bb04b8ca452ea44f99e16aa774da22b36e6deb8a966dfaff1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::crosswords::formatter::push_color (cognitive 18): rio_vt::crosswords::formatter::push_color has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/formatter.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf8494505ff3d23c190aef5fca82aa4c8a7cc61439f216fda87d8bbe3a20af0"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialKeyEventInfo::from_message (cognitive 18): PartialKeyEventInfo::from_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1ae5d08d1dfa8b490d001d289143a9a4bf93eba3fec14d708e1975f1abdb49"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::macos::rasterize_glyph (cognitive 18): sugarloaf::font::macos::rasterize_glyph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/macos.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9e61bf9ec631ab3c217e8ff0116f92b181ea235dd28151ac6173d8ee755fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::loader::find_best_match (cognitive 18): sugarloaf::font::loader::find_best_match has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 5 (7 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/loader.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fd80905c56c6efe78cc1d7f5b3ed2b3a082e7a4bc764c21812c424eab89f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::emit_preedit_cluster (cognitive 17): rio_grid::emit_preedit_cluster has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-grid/src/lib.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113c6c0759dc7aaaa737f7a628f66044a00539ca4cc37faa056a229b145ac5c"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::emit_underlines (cognitive 17): rio_grid::emit_underlines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-grid/src/lib.rs"},"region":{"startLine":2780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66ad2be8a9aca8d21564cec2488f1ab1a5751f690fbe513a5849e1c4623baeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::scroll_up (cognitive 17): Grid::scroll_up has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 5 (6 pts), boolean chains 2 (nesting depth added 5). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab69c3c47fdc35c45b652cdf6047030b5060c7a43e37dab180cead4b06de4765"}},{"ruleId":"D2","level":"warning","message":{"text":"EventProcessor::xkb_event (cognitive 17): EventProcessor::xkb_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (6 pts), boolean chains 2 (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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed899181dc4c5013e9181083e6d75e39606c02a1cf6ae9d6e8ba3e2679f60f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyEventBuilder::synthesize_kbd_state (cognitive 17): KeyEventBuilder::synthesize_kbd_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2df613f9d4a6570d311d17b022039ec31077811f6b39542a7219e185755340"}},{"ruleId":"D2","level":"warning","message":{"text":"Text::shape_for (cognitive 17): Text::shape_for has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/text.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de3e7058b0e7870c1bc5664f00afc10caeb3321049a1581b8a07166188e3555"}},{"ruleId":"D2","level":"warning","message":{"text":"Text::rasterize_slot (cognitive 17): Text::rasterize_slot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/text.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3b4eaaf00ddf054afbd6dcc011168bf6c35b2a7f0d1d415ce6cef29412acd2"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::grid::cpu::blit_mask (cognitive 17): sugarloaf::grid::cpu::blit_mask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1228f705ac095de864930ba288fd869d73b4a2f358d7a11464478f3cf4a6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::text::blit_text_mask (cognitive 17): sugarloaf::text::blit_text_mask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 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":"sugarloaf/src/text.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b459c9df73792e61d88535b5ceeed3f03c1f93a0b30716dd098b0a4233445a"}},{"ruleId":"D2","level":"warning","message":{"text":"rioterm::bindings::kitty_keyboard::build_key_sequence (cognitive 16): rioterm::bindings::kitty_keyboard::build_key_sequence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/bindings/kitty_keyboard.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f01c7eb868de25ebdb861e86c945ccfa1a08e3507efc3222fe1fabfd3b1bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"PreeditLine::new (cognitive 16): PreeditLine::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 3 (4 pts), match/switch 3, boolean chains 2 (nesting depth added 2). 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":"rio-grid/src/preedit.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6381373f8810ae7f407fa58652c8dbd63fccd9e7df7855317d98070ed724c6eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_grid::emit_strikethroughs (cognitive 16): rio_grid::emit_strikethroughs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-grid/src/lib.rs"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b14ba778ed469215a9cf8d10c214f5f023dfd7ea064d1fe30637ebbf4dc82f"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid::scroll_down (cognitive 16): Grid::scroll_down has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (nesting depth added 6). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b623d592322f147abdf4c238b3d656b8f633f140b1ba154e06fd3ac9bf22b59e"}},{"ruleId":"D2","level":"warning","message":{"text":"rio_vt::performer::parser::trim_valid_partial_utf8 (cognitive 16): rio_vt::performer::parser::trim_valid_partial_utf8 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), 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":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"476c056b4f5fb09a442bda6e227f8a2ba80bb0586e416b53c8b0174ffe0d4d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"EventLoop::poll_events_with_timeout (cognitive 16): EventLoop::poll_events_with_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1613cde745492613663eebbfc81eec38e90e6633f696dd05710bea51f3d5de"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowState::configure (cognitive 16): WindowState::configure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 3 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b399b68646e602f26da4b889ce8852005f2fbf594d9734ea0e969a649e37fa"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorHandler::set_cursor (cognitive 16): CursorHandler::set_cursor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (3 pts) (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":"rio-window/src/platform_impl/web/cursor.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a4ee03255408cd3a2bde3a13a7dae840c17f7884a22def78a9a2b96c7f4956"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialKeyEventInfo::finalize (cognitive 16): PartialKeyEventInfo::finalize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (4 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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e2806697fa8169fa01bcdd2cd63dda8c94713f8d070293229938f48bd5ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowDelegate::setup_display_link (cognitive 16): WindowDelegate::setup_display_link has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function item inside it that branches (vsync_callback). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dcd37e983af7a4a95a8a3d279bb7b5321acf749a68763ff04c14e98cfae0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowFlags::to_window_styles (cognitive 16): WindowFlags::to_window_styles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/window_state.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca8edd747e30bb0550807b81b415c21c38feae0818adb78de4635ef08883720"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::macos::apply_variation_overrides (cognitive 16): sugarloaf::font::macos::apply_variation_overrides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/macos.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacc99a5e1c526458966757fd476b36f1c2cd8cef9aef5237aca6115c1721fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::font::macos::shape_text (cognitive 16): sugarloaf::font::macos::shape_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/macos.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3123b35937066d8234044ceb0248b979bc8c919c045c3e82236c5893a6990d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"sugarloaf::sprite::braille::draw (cognitive 16): sugarloaf::sprite::braille::draw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/sprite/braille.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7452afbdde43a1971d3ebda35b5bf72c52b0e2797db602354d48a9cc9801e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::windows::event_loop::public_window_callback_inner: FunctionTooLong \u2014 rio_window::platform_impl::windows::event_loop::public_window_callback_inner runs 918 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 818 over it, 9.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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3b728365272eb6acbe79090f013462b4598d85c0d4e373f0e39e20d719b109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screen/mod.rs: FileTooLong \u2014 3181 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 2681 over it, 6.36\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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ebdf543945b97b06dfac73824ffc5c62730138a6180f5eea63e21da21dd42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/mod.rs: FileTooLong \u2014 2076 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 1576 over it, 4.15\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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8167e62382361f28cdf4e9dbf2c800b08f10fb8eeb766907985d5af6a8da13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_grid::build_row_fg: FunctionTooLong \u2014 rio_grid::build_row_fg runs 399 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 299 over it, 3.99\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":"rio-grid/src/lib.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ae4cfb5bc5993c72ae0a369d7e0d3231a7d20172ae2275fa822b398b3b2de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1886 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 1386 over it, 3.77\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":"rio-grid/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e574ec6f00760cbe837ea0dd55d85395557aa2b628343f8bb3b94bd438af1371"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Screen: TooManyMethods \u2014 113 methods. The bar is 30 methods; this is 83 over it, 3.77\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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7393956841e95c73c8c026f49c7eabf6ce373f5a6968be5aa35847de19e0547"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActiveEventLoop.register: MethodTooLong \u2014 register runs 375 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 275 over it, 3.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":"rio-window/src/platform_impl/web/event_loop/window_target.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f0b65ccd378214be2ab64224106943412ed50b317b49fea10904834723755b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/event_loop.rs: FileTooLong \u2014 1726 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 1226 over it, 3.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26349ff384841cae6ad3cb5c883bac550db83666e8ae7ca945a5c284cb794d6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WgpuRenderer.new: MethodTooLong \u2014 new runs 342 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 242 over it, 3.42\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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e1fc19cc4962df2c7ac03ce8a32f9b17c7ec7e49f99f2a28c64f3986e7218c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnownedWindow: ClassTooLong \u2014 1329 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), 94 methods, 2 blocks, lines 119-2067. The bar is 400 significant lines; this is 929 over it, 3.32\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":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff47e9b4a4ad2c549f4ca954f75139126448c54a05cc87ce6d9c2909a45211c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_vt::ansi::kitty_graphics_protocol::create_graphic_data: FunctionTooLong \u2014 rio_vt::ansi::kitty_graphics_protocol::create_graphic_data runs 328 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 228 over it, 3.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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0383a924f89ece44bdf9a02ace8d698c2e421736977553f8237b229906f78b84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnownedWindow.new: MethodTooLong \u2014 new runs 318 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 218 over it, 3.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":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f80261585eaf195ede8d394dcda93f1dbbab8e91cf30191105f3a90a1c7347a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnownedWindow: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2608aac912bbf93b28e51e2e20eea1bb623de7481270cef020f2eb587daa8d8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EventProcessor: ClassTooLong \u2014 1243 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), 42 methods, 2 blocks, lines 48-2099. The bar is 400 significant lines; this is 843 over it, 3.11\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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c00fcdadadbdc6f94dd37d9d58b6dd6ca38d2f68509192130b3de2f5bd5c467"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.run: MethodTooLong \u2014 run runs 309 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 209 over it, 3.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b95330a7a59e3f1144a06245e60966966aedf479312d54f4a765c6370d26680"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/application.rs: FileTooLong \u2014 1521 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 1021 over it, 3.04\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":"frontends/rioterm/src/application.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4492a6cb5a641b52f29dc781eeea6ecdc1bd6097ba0f8be2bc5ff121d836d3c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WindowDelegate: ClassTooLong \u2014 1187 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), 79 methods, 8 blocks, lines 164-2518. The bar is 400 significant lines; this is 787 over it, 2.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c7eba4e7a3674dd1500ca7f688b8f0793b279b94ad46a8dc5659f3f63d0f41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: macos/window_delegate.rs: FileTooLong \u2014 1465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: WindowDelegate (8 blocks, 164-2518). The bar is 500 significant lines; this is 965 over it, 2.93\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":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a65cd90ab20dace3cd6126576a84c33a97c4d8c7b30fb6106ba0507f5edaeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::sprite::branch::draw: FunctionTooLong \u2014 sugarloaf::sprite::branch::draw runs 290 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 190 over it, 2.90\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":"sugarloaf/src/sprite/branch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b196625e8d13201cd37d3a7dadc02510e0539931da1780e181b301b07c7cd81f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x11/window.rs: FileTooLong \u2014 1438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: UnownedWindow (2 blocks, 119-2067). The bar is 500 significant lines; this is 938 over it, 2.88\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":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1d68e7f922df61fc41884f361ff7fb67eb72f11e5659464ce4ea8948a68e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/text.rs: FileTooLong \u2014 1430 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 930 over it, 2.86\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":"sugarloaf/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fc44b031a7d9c96a550d2fa814022d15a7a0539b79284387d8d58a1c7a3d23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_vt::ansi::kitty_graphics_protocol::parse: FunctionTooLong \u2014 rio_vt::ansi::kitty_graphics_protocol::parse runs 284 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 184 over it, 2.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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"db611ed358e65cf85626493364c74d3969ed6fcc8d50aafa6504801bd0eba39c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WindowDelegate: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf62a331669466dd643d80a93c23eec2b002fdd1312db619d83ce36b201b673"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Renderer: ClassTooLong \u2014 1052 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, 2 blocks, lines 838-2626. The bar is 400 significant lines; this is 652 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9a8b58c8aca64bc07727930d1a4e87b85ce0fc5054e3ba0d339fe8bf2bdc29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x11/event_processor.rs: FileTooLong \u2014 1296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: EventProcessor (2 blocks, 48-2099). The bar is 500 significant lines; this is 796 over it, 2.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bb7227f81f7f9b55ee89b7ebb9a508de26439c85da5eb9583956018a90988c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Window: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\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":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f176fd3b8ba8d6b2209d8b44280b21d772b8ca926c52f56cc2b152d69536a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grid/vulkan.rs: FileTooLong \u2014 1207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 707 over it, 2.41\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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86605eadc73c32662620e89d9a76b3c65f8d88a267e60d61214f1b8d19aac6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContextManager: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\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":"frontends/rioterm/src/context/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9c0e8ee8d03c33ad301e27a6f56d1d62863a1a930fa04df497f416b2b322cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: font/mod.rs: FileTooLong \u2014 1183 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 683 over it, 2.37\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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b990851f7e4dfc4da1b75727070359712bbc7ee6b185e09b4d0663b69d76a4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/vulkan.rs: FileTooLong \u2014 1141 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 641 over it, 2.28\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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3847edf8c2460c13c39e7c511d657b8a994695e25d767694aef86a3943b0df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: performer/handler.rs: FileTooLong \u2014 1140 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 640 over it, 2.28\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":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e959fd0f8007ed5b37a02e1812952da83f182d9a56aa924ed0010721eeef1fde"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContextGrid: ClassTooLong \u2014 903 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), 55 methods, 2 blocks, lines 108-1673. The bar is 400 significant lines; this is 503 over it, 2.26\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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"62435ae11b5a454e2d01c773d83398e36b7b092e11adeeaa3b683bb9ae456207"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/window.rs: FileTooLong \u2014 1114 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 66% of them inside a single declaration: Window (3 blocks, 98-1249). The bar is 500 significant lines; this is 614 over it, 2.23\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":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79826234c83c1f38b39b89e644f7051e724f996d70dc17e75d5c2b67d419072"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/mod.rs: FileTooLong \u2014 1108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: ContextGrid (2 blocks, 108-1673). The bar is 500 significant lines; this is 608 over it, 2.22\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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cb08742d8a2a1f04e007bbc15ba7cafd7654e4d00184806a0cb47aa11515ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/capi.rs: FileTooLong \u2014 1086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 586 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"librio/src/capi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2210407c61dfa5335f17ad14c477b27a512adedd147157711f610b36991b9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: libsugarloaf::capi::sl_render_surface: FunctionTooLong \u2014 libsugarloaf::capi::sl_render_surface runs 214 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 114 over it, 2.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":"libsugarloaf/src/capi.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b000d2642154bd775f5e597bdfc032946fb54643f394b0678ee117dc56e78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::windows::keyboard_layout::vkey_to_non_char_key: FunctionTooLong \u2014 rio_window::platform_impl::windows::keyboard_layout::vkey_to_non_char_key runs 209 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 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af41919e419bbf8789a9b46a56cb334c26eddef96296198b2d222a78585bf55"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Window: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\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":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d112c57eabfa7fde5aa12a409ced66d263403ed3668e634e8c24e0e843375f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Island.render: MethodTooLong \u2014 render runs 204 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 104 over it, 2.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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"69988da8bf096fe7c1685829b213cd862c746beab3b73fd6cb02493ec33b00b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Window: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2468dff823ff7f0d5fe6c171c0992f1a5f59a63ccab6e76e9a7590ffaffc2df0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::linux::common::xkb::keymap::keysym_to_key: FunctionTooLong \u2014 rio_window::platform_impl::linux::common::xkb::keymap::keysym_to_key runs 202 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 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aed42a0d04b49723a6a5ed5f9252cd69651854bb2a9072ac8261b3cbc464985"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::windows::keyboard_layout::keycode_to_vkey: FunctionTooLong \u2014 rio_window::platform_impl::windows::keyboard_layout::keycode_to_vkey runs 201 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 101 over it, 2.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":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4291774582ff88704e4ded315cd161817652ad23a40f16a60273e821e2d995"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalRenderer.new: MethodTooLong \u2014 new runs 199 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 99 over it, 1.99\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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfda5ffd0e21e1754abef5707810cbd708985b66b482cd00ec80ff70963c86b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render: MethodTooLong \u2014 render runs 197 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 97 over it, 1.97\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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffdf53e306aebbdf2db8f43eebafe883ab9b4c33747f863ed2e88e6cb4c8823"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Window: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9bca4f058e9f0b0d87b2edb47533f23b9f05cd2535f1634c85248c5432bd29"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: XConnection: TooManyMethods \u2014 59 methods, declared across 14 files: x11/xdisplay.rs (15), util/cursor.rs (7), util/geometry.rs (7), x11/monitor.rs (6), \u002B10 more file(s). The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/xdisplay.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b2a57694ec402db23aab31f61cbecef134195f36b228b527c885b4902ef81"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Window: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/window.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"810cef1166e5db0350e0515820090dbbc7df07232719f81c767d0cd6efa68c78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ansi/kitty_graphics_protocol.rs: FileTooLong \u2014 966 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 466 over it, 1.93\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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7bcaf9cb03088d74f1c372342bc114469fd07c8c025d6da04e1cadbcf62f33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/vulkan.rs: FileTooLong \u2014 954 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 454 over it, 1.91\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":"sugarloaf/src/context/vulkan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8537ed17f664c0648013c8d4876b2cacf1657734bbdeef2189acc754df2ae5d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WindowState: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb4fc5009fe65ed773040b0a54da1d6519dc089f08b2b96d5058dded52f7c78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/island.rs: FileTooLong \u2014 945 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 74% of them inside a single declaration: Island (2 blocks, 342-1478). The bar is 500 significant lines; this is 445 over it, 1.89\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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67adda4c92dce450b848c1dc154f8a3fb94d7321b38aaba3308a1bec09c0bf9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/keyboard.rs: FileTooLong \u2014 939 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 439 over it, 1.88\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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33314951a432b9e327cb712545fa570e8bf78fa36f26289c21596659de2ffeff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Window: ClassTooLong \u2014 736 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), 73 methods, 3 blocks, lines 98-1249. The bar is 400 significant lines; this is 336 over it, 1.84\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":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"404c0b8c60128f7be876f00492f6440ab0ad80900161c4f49a55bea313a47b63"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContextGrid: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"883e05ede55aa6fdfac838ad19c22e41d6e53e1d2cd47e3bffa03a61a1202db7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Inner: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"rio-window/src/platform_impl/web/window.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f423e6bd3d145825bead1f89ff88b680df00f598c67889a65a2d124db2ad9b3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WinitState.event: MethodTooLong \u2014 event 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":"rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf1e3c850030539442625c3d334bf7bb1519dd7fdd420f7c3115197c46c6f85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Performer.csi_dispatch: MethodTooLong \u2014 csi_dispatch runs 182 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 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"075899692d1d4c41efa902e45fcf37a858098a72413897986d8ae40cf751f263"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyEventBuilder.process_message: MethodTooLong \u2014 process_message runs 182 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 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1fdc8ec6e3d69efbe5713eeb2ba454a719f08859c814025e548ffcf99f7942"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/mod.rs: FileTooLong \u2014 898 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: Parser (2 blocks, 35-1144). The bar is 500 significant lines; this is 398 over it, 1.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5101900b44b8775d56feecbaf1e9ed152d11bb8d5317154572e5d1833bca412d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/capi.rs: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 387 over it, 1.77\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":"libsugarloaf/src/capi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19548357a3f3ec541312132552a1b70ef75763288f6f8cc9d32dc2a82f7a6e42"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Text: ClassTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 151-1167. The bar is 400 significant lines; this is 301 over it, 1.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/text.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d28fddce1a3f923accdf14ec35b8f0179d3d7ab0852a8e734a6b0f1a9a32db3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Island: ClassTooLong \u2014 700 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), 30 methods, 2 blocks, lines 342-1478. The bar is 400 significant lines; this is 300 over it, 1.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13aeefcab9d53608b3b5d1973747a71502fa9e5c53306bba5dfa10688cba58e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode: FunctionTooLong \u2014 rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode 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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04d06196a12e49f24660da45b8bbf9b1cc1e24da8c0b8ddde42121e87676d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RioTerm: TooManyMethods \u2014 52 methods. The bar is 30 methods; 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":"librio-wasm/src/lib.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbcc1f668059e95747dec20876a11b5f24b19f247a99eacd500d9b219862391"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/mod.rs: FileTooLong \u2014 855 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 355 over it, 1.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":"frontends/rioterm/src/context/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe5afffa255d5e9e83e70a011254a7dd12f5e731e954b0ca1748f0b3bb1ac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x11/mod.rs: FileTooLong \u2014 851 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 351 over it, 1.70\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":"rio-window/src/platform_impl/linux/x11/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069e7fe7eabe9106b0284bdfb52436120f249b531bb6a2c6a18c23178861cc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: font/macos.rs: FileTooLong \u2014 848 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 348 over it, 1.70\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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd0c18b1c8ffb9c7858c4c48fe8a20a1702b6f82deea1fa11e8fc8baa4caf69"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Renderer: ClassTooLong \u2014 676 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), 11 methods, 3 blocks, lines 153-1218. The bar is 400 significant lines; this is 276 over it, 1.69\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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41cbc4159c0030102e39fb29a5ef801af1aeb9df105a90e98f7d4491db62f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandPalette.render: MethodTooLong \u2014 render runs 169 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 69 over it, 1.69\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":"frontends/rioterm/src/renderer/command_palette.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"74589c1c7383f402d7707fbf382a8fe30df69c95811f8953342c6a40047b821f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::linux::common::xkb::keymap::physicalkey_to_scancode: FunctionTooLong \u2014 rio_window::platform_impl::linux::common::xkb::keymap::physicalkey_to_scancode runs 169 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 69 over it, 1.69\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":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"17293ebe6c852a730345df1d6a5fdc2e2b184db5b1da4be9acd8d4f175993873"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WindowState: ClassTooLong \u2014 670 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), 57 methods, 3 blocks, lines 58-1199. The bar is 400 significant lines; this is 270 over it, 1.68\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":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79196334093127edd712ed80d840716872193a96a7d650e33d140bb5548f7fa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/poll.rs: FileTooLong \u2014 836 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 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/poll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc130ffde4bfa83bb64e48fb0f9df21bcffbf47e4433a15b71be39a0106bdd7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WinitView: ClassTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 6 blocks, lines 165-1295. The bar is 400 significant lines; this is 254 over it, 1.64\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":"rio-window/src/platform_impl/macos/view.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"212c0ce73bac19bd26c011450c4c21aaf3e36b5aff30066018adfcb8d615c026"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::linux::common::xkb::keymap::scancode_to_physicalkey: FunctionTooLong \u2014 rio_window::platform_impl::linux::common::xkb::keymap::scancode_to_physicalkey runs 162 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 62 over it, 1.62\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":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8952ca5463d4b9595c9d0b3e65432ec4ac4230068be19463abba862cada6f9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::windows::keyboard::scancode_to_physicalkey: FunctionTooLong \u2014 rio_window::platform_impl::windows::keyboard::scancode_to_physicalkey runs 162 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 62 over it, 1.62\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":"rio-window/src/platform_impl/windows/keyboard.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bb209e287f489b4453126c1541e873b84bdd1e5811c5482af31a9a221c8944"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: macos/view.rs: FileTooLong \u2014 805 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: WinitView (6 blocks, 165-1295). The bar is 500 significant lines; this is 305 over it, 1.61\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":"rio-window/src/platform_impl/macos/view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890f63f2bb9ed419c9a0bf4c2e9dd9c07d0af95346beecadfc1025073e5dade"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ansi/graphics.rs: FileTooLong \u2014 800 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 300 over it, 1.60\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":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae60bccb12866ff68af7be060f50fabbc6bcd57f565f869b0c3891f3a9ef0cb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 639 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), 44 methods, 2 blocks, lines 35-1144. The bar is 400 significant lines; this is 239 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662961f2b9a750cef3cea7f37aab282626e50d225128ac6c3039aa9fc38136f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/batch.rs: FileTooLong \u2014 792 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 292 over it, 1.58\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":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e585828904ea3ac19459718bfcf4fca96d31173206e265aaff71968a2c13ecaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::macos::menu::initialize: FunctionTooLong \u2014 rio_window::platform_impl::macos::menu::initialize runs 158 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 58 over it, 1.58\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":"rio-window/src/platform_impl/macos/menu.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"042d6e422bd0a61d2ec94f2ef5b9a8c6a07b280f0cc79efa08d25097440aa123"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render_metal: MethodTooLong \u2014 render_metal runs 158 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 58 over it, 1.58\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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"98658d6c8621f3abd507d3d280f5c6e777273b153e903dffdb1201da776b86b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Sugarloaf: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/sugarloaf.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21ba9528239605a21a62f5a8a6ea73371d3f5a8a6e3669213088464beee40af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::renderer::cpu::render_cpu: FunctionTooLong \u2014 sugarloaf::renderer::cpu::render_cpu runs 156 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 56 over it, 1.56\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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"48404e12eaa37d2c25d5f61a1c5b6088d7ae21f8508504de95323ca3c5e360ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/mod.rs: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Renderer (3 blocks, 153-1218). The bar is 500 significant lines; this is 271 over it, 1.54\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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0821ecbc7a65285cae91d5cae63922b8290ae9dab4ccfd808426a03213cf4f0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/keyboard_layout.rs: FileTooLong \u2014 770 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 270 over it, 1.54\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":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba044b43332954a83100e0470f0531586ea6b30eeea139ad512c2f6f975a61a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Island.render_color_picker: MethodTooLong \u2014 render_color_picker runs 154 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 54 over it, 1.54\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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f317da7a0dba6f8f814820a06434b4ec40150cbf588b62915d799766fae64ee9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::sprite::box_drawing::lc: FunctionTooLong \u2014 sugarloaf::sprite::box_drawing::lc runs 153 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 53 over it, 1.53\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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aeeade007054ba4bb6f7a2e218a0873841ac28a0360ea89193f7a94aac2a3b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Sugarloaf: ClassTooLong \u2014 604 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), 47 methods, 2 blocks, lines 23-1259. The bar is 400 significant lines; this is 204 over it, 1.51\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":"sugarloaf/src/sugarloaf.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f2d9b9bb918311fedb28086c80335347471dd6a0cdaead46f48aea0b90aa84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render_graphic_overlays: MethodTooLong \u2014 render_graphic_overlays runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dd8e69e7372ec787fa266c42d8d4e8ef91b53cf904adf28153901faf171520"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Shared.set_listener: MethodTooLong \u2014 set_listener runs 150 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 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/event_loop/runner.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aff467b588692b974ffe64f135b24fe122701a1391383479044d66bb4ddda2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: window/state.rs: FileTooLong \u2014 745 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 90% of them inside a single declaration: WindowState (3 blocks, 58-1199). The bar is 500 significant lines; this is 245 over it, 1.49\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":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7695539d2da1c5b67d945141660de81211222a4dfdfdece2b7d97b800ca5a3cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventLoop.new: MethodTooLong \u2014 new runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/mod.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c6bdb05d1886ddbceaaacbfcf22bb6da1016e465bfc06f75ff792dcc2dd9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Route.has_key_wait: MethodTooLong \u2014 has_key_wait runs 147 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 47 over it, 1.47\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":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"388a377fe77a07551f0328bd1a677cc65f4fbf9758cdced3d4f2d6b72675bc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c30298b38e320a7479a9c720f7b7ddf119e98090239d1ceb1f1bea93b0c1bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageCache: ClassTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 65-1023. The bar is 400 significant lines; this is 173 over it, 1.43\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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c7c881f81d1eea219d1fdd677b63bf5a30e755f0de8b90e640d73c434b5442"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/keyboard.rs: FileTooLong \u2014 716 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 216 over it, 1.43\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":"rio-window/src/keyboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15af71457887e20d9e7722357bc50bbbff012c9da547099ba033b3957119c4fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WgpuContext.new: MethodTooLong \u2014 new runs 143 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 43 over it, 1.43\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":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe205228c8896c0980e7099d8585d7919735556e3f6c31dbeb773435a6be1a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventLoop.single_iteration: MethodTooLong \u2014 single_iteration runs 142 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 42 over it, 1.42\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":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd44258441bae9590390d4ada9196c90229a98e4b4c9e9eb7fae380ed9ba31d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Grid.shrink_columns: MethodTooLong \u2014 shrink_columns runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/resize.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4c126cd2ea966fb234caa43656b051588f80734330e6da2b109710f8f49ae2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WinitState.pointer_frame: MethodTooLong \u2014 pointer_frame runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/seat/pointer/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43f2cddc5de1693dafb45e4f8e358e6347572a9829087f70a016c584070fe0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sugarloaf.rs: FileTooLong \u2014 704 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 86% of them inside a single declaration: Sugarloaf (2 blocks, 23-1259). The bar is 500 significant lines; this is 204 over it, 1.41\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":"sugarloaf/src/sugarloaf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b082d4adebbc81189264cfb0767e1a01fc6f7e3a485a6f27c245aa33053c791"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EventProcessor: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"233161e7039358c6f56ef2cbefec29d6b7bb97718db5eba3edfe29fed91f81b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xkb/keymap.rs: FileTooLong \u2014 700 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 200 over it, 1.40\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":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"625fbac84559f71f53d575e98dbeb226a4d084c0a091f702b27115b893b70daf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: teletypewriter::unix::create_pty_with_spawn: FunctionTooLong \u2014 teletypewriter::unix::create_pty_with_spawn runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaef864d1020a7b535b0bee946133d2b3ab6ca017c8cb76a22a29f6bdb78029"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Colors: TooManyFields \u2014 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/config/colors/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29e2b8b3b14e3df38d87a89c1fe3a095438677c2345f9a642eeb72603615a75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.push_virtual_placeholder_overlays: MethodTooLong \u2014 push_virtual_placeholder_overlays runs 139 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 39 over it, 1.39\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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc5e0913e978333a3a00016db6d9f4a57d80f91525faf2e0851c5717fc00bb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::sprite::box_drawing::draw: FunctionTooLong \u2014 sugarloaf::sprite::box_drawing::draw runs 137 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 37 over it, 1.37\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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2195646a25a6e167244c6a7c02f95764c7896696faba5af97201448993adbad9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: KittyGraphicsCommand: TooManyFields \u2014 41 stored fields. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6cb29e618ad315c3dc234575eeea56792c93908260cf4f7fc520b20b745654"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Performer: ClassTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 746-1637. The bar is 400 significant lines; this is 136 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/performer/handler.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e969c64b51a98dec15764660db461dcf9ce9eb1c4a77a52a7f3a0fdf372266"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Grid: TooManyMethods \u2014 40 methods, declared across 2 files: grid/mod.rs (35), grid/resize.rs (5). The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/grid/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6244ea4dabd2733a7d29082d953f8aff19eab0cd4d4c3e992aa8d27a5101b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_vt::performer::handler::get_termcap_capability: FunctionTooLong \u2014 rio_vt::performer::handler::get_termcap_capability runs 133 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 33 over it, 1.33\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":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ac0343630fd52e799b44d0d1446bc57a9ab82d4c68d1088477da3a04cadac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image_cache/cache.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: ImageCache (2 blocks, 65-1023). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"885c220faa5b8529bfb3f13b547e8ae23b74a613c9671c444111eb8b7832ed48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/mod.rs: FileTooLong \u2014 652 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 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c01630f2feb40012ae4797f53b4d0ad3980062a8a0c1dbf15c9ada4488081"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: linux/mod.rs: FileTooLong \u2014 651 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 151 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a8d2d5fb196495ce6699bc863edceac123fa79f673152246230ba406441610"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graphics.evict_images: MethodTooLong \u2014 evict_images runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"001691a2ac9d7f2d66987669ca8ed5eb239aa2e0a063c2f51918a1210d3d916b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/mod.rs: FileTooLong \u2014 649 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 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"569eb53103f63b1ccf3150e508ecde3fdc6826f5fc4d12dd79fb9d8e035b0623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/cpu.rs: FileTooLong \u2014 647 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 147 over it, 1.29\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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef57a024a29aed4098a235b05eb67abdbf575654b1c3aaf5d3f2fd14371a3883"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/window.rs: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: Window (10 blocks, 72-1744). The bar is 500 significant lines; this is 141 over it, 1.28\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":"rio-window/src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ae8b75b3c62b10201da4f25bfd939f77345b1b112648e57a11f2ad0af2c331"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::macos::event::physicalkey_to_scancode: FunctionTooLong \u2014 rio_window::platform_impl::macos::event::physicalkey_to_scancode runs 127 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 27 over it, 1.27\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":"rio-window/src/platform_impl/macos/event.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d82b0611d143ef5011585bf53186b8595a32d7e3c0b031b94bc81554486f458"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::macos::event::scancode_to_physicalkey: FunctionTooLong \u2014 rio_window::platform_impl::macos::event::scancode_to_physicalkey runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/event.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5715d08bdf7043640a392ca4d8eb2eae5bc2e01ee9234ec5398ff7a147ea3ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VulkanRenderer.new: MethodTooLong \u2014 new runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ca0b5835f5b8c900af52127a85a376ca6496434ddfd08c593c9020c85def4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: WindowState: TooManyFields \u2014 37 stored fields beside 57 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"784bb98e5f9e1bb7483f85e5c3d66b67075c2ba1871f2dffd4ab317c5974bbf3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Square: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"rio-vt/src/crosswords/square.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789bb17d594d4aa4b8157ab93df8e7b57449906680b2db16b3a3aef37b93a62"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 37 stored fields beside 6 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-backend/src/config/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6dbcc974ac365a4d9465d3add1eb2c007bdb9227be3a8b26cf25ad5d55a179"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Text.shape_for: MethodTooLong \u2014 shape_for runs 123 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 23 over it, 1.23\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":"sugarloaf/src/text.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf7981b5e3e5a81b42fcd25c551db1c342e1682eeab1af5062e77a38c85926f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventLoop.process_event: MethodTooLong \u2014 process_event runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f876f946d7612ab1853cdd9b1a9594eaee93fbe9d5fed487520827a1e2cdda5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Text.rasterize_slot: MethodTooLong \u2014 rasterize_slot runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/text.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad16d7bdd2c8674a6b8442973680446380315b107ea9aaef350d73e8e3fbfd46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/command_palette.rs: FileTooLong \u2014 608 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 108 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":"frontends/rioterm/src/renderer/command_palette.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfd5ba4fb79dda3029aa8822c1d8de23130f0449e07a6b724a5745a21525c99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventLoop.run: MethodTooLong \u2014 run runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b740259c3314f84c3ba460afe322efe8ffb470e900c87dbce316868834311af7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VulkanImageTexture.upload_rgba: MethodTooLong \u2014 upload_rgba 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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ab174fd5e29c64b048f21500ce46a97ee5abfabb6f9ec2ed116e205a4fd50c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grid/webgpu.rs: FileTooLong \u2014 590 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 90 over it, 1.18\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":"sugarloaf/src/grid/webgpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67c71dfe27ade940a2b0c3d6eecd74aa2688caeb1bc64d771bcbf1da25e84ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: orbital/event_loop.rs: FileTooLong \u2014 588 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 88 over it, 1.18\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":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"336b6611eed2b149798896ec16445e3ee81305804620155725cc616090c9ed9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Canvas: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"rio-window/src/platform_impl/web/web_sys/canvas.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a934a9145642c8720b672da69c2beb3d87b59433da105a87e5f43ea66488bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::renderer::vulkan::build_quad_pipeline: FunctionTooLong \u2014 sugarloaf::renderer::vulkan::build_quad_pipeline runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"149bfa094e7782aa7a0dbb8eeb12f560e924f764d76599943bd45127c8e9c398"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::renderer::vulkan::build_geometry_pipeline: FunctionTooLong \u2014 sugarloaf::renderer::vulkan::build_geometry_pipeline runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"39098bb34b06c839621bebabe2e93256fa8c1df5fed3e2cf117fbae294ef0452"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventProcessor.process_xevent: MethodTooLong \u2014 process_xevent 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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77b592561b0c4c9949826bb1beda0e5060a41ec9e1544e1077747027539065c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventProcessor.configure_notify: MethodTooLong \u2014 configure_notify 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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c222c1c82fe4bf4633680a28f477067e45a2777e56e3007e59bb999451be3717"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Graphics: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 3 blocks, lines 572-1405. The bar is 400 significant lines; this is 52 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"17119380fe7a5ec84104a6dfe5893034cab1e3717bccb189ed20b62d92b31861"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rio_window::platform_impl::macos::window_delegate::new_window: FunctionTooLong \u2014 rio_window::platform_impl::macos::window_delegate::new_window 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":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bda954567cda85c119aa896fc111f56c890de26f3711ac9de754d7254ff81a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalRenderer.render: MethodTooLong \u2014 render 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e64bf482eff41fc5296301f47ffd880820a82bdaf934e40517aca8015d95ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::text::build_text_vulkan_state: FunctionTooLong \u2014 sugarloaf::text::build_text_vulkan_state runs 111 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 11 over it, 1.11\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":"sugarloaf/src/text.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"56abbd40af0d0408f4c673e4d52c7beba8a2eee34a239503d3a4f709def910d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grid/metal.rs: FileTooLong \u2014 552 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 52 over it, 1.10\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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5f86d1802c4a73d4bf049a08c18e803fcac199445593d63b7937881b09c88b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WgpuRenderer: ClassTooLong \u2014 441 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), 4 methods, 2 blocks, lines 76-3195. The bar is 400 significant lines; this is 41 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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2651a943aeab8119a8955054b4f0f7cb10a4f61fe0c8cb5e456cf7ccb5394fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/cursor.rs: FileTooLong \u2014 551 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 51 over it, 1.10\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":"rio-window/src/platform_impl/web/cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3034c14cb2f336fc85a4d1db5129e0f595a05239cfeb763a4fde59fb65ecc234"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ApplicationDelegate: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 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":"rio-window/src/platform_impl/macos/app_delegate.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f440a0f4d862f1a0e306ce42cb8217e26fb3aea38cd50f263eafef80c1b0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchOverlay.render: MethodTooLong \u2014 render runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/search.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1af08f9dc4503adfec0171bf00d8a85e7581e52a4b2759ef2845e082c3614b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Window: ClassTooLong \u2014 436 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), 59 methods, 4 blocks, lines 40-731. The bar is 400 significant lines; this is 36 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79297c60f85fce60596e1cdcc875bef0207dd0bed64242afcb5db3034558a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::font::macos::rasterize_glyph: FunctionTooLong \u2014 sugarloaf::font::macos::rasterize_glyph runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/macos.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117e8b186b31b5e12ae4fcd4246889aa5121f6884d0e48dff3a5f2f75c6eba7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageCache.new: MethodTooLong \u2014 new runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"462c4a7c571dcec38a9b481b1fb8a0593885fa35cb884ba437808db01bfdcbe6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ApplicationDelegate: ClassTooLong \u2014 431 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), 33 methods, 5 blocks, lines 86-806. The bar is 400 significant lines; this is 31 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":"rio-window/src/platform_impl/macos/app_delegate.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0c57976a71518d160d5ab644fa7da9175f003af87f5f4c6225406a5036f312"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActiveEventLoop: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 49-743. The bar is 400 significant lines; this is 29 over it, 1.07\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":"rio-window/src/platform_impl/web/event_loop/window_target.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"184e0ef503421f8cc033d7b9769922ffc1bce734f4771f296527129be07dccc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: macos/event.rs: FileTooLong \u2014 531 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 31 over it, 1.06\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":"rio-window/src/platform_impl/macos/event.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b389d8cc5a211395031b47bb48744fb3b71ccbad3c94136be556dc670412fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventProcessor.client_message: MethodTooLong \u2014 client_message runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3fe1779dff0c22451409e29f5a0ea693ebe0112a6df62bf7ef6c2037e003b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageCache.allocate: MethodTooLong \u2014 allocate runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b837145afbb8daefb443d6cbea407db745cda2977058bff7816ec003252cf4f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grid/mod.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Grid (10 blocks, 40-1000). The bar is 500 significant lines; this is 25 over it, 1.05\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":"rio-vt/src/crosswords/grid/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3764297e26ad63c71d65fdfdb72af798c9d9a18a87e56fc8b57896f34866f6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Window.new: MethodTooLong \u2014 new runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4277e592525b56fa07cec24f957c6487e3c13bfddfe2217f65a4b79b693dc81d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageCache.process_atlases: MethodTooLong \u2014 process_atlases runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b769f737acee7066d0c53b5fbcd73a953f1975182af033db12b3804ef287e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: macos/app_delegate.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: ApplicationDelegate (5 blocks, 86-806). The bar is 500 significant lines; this is 23 over it, 1.05\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":"rio-window/src/platform_impl/macos/app_delegate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d077b92c274c3521450653188771aa00e86cc14a3bf38e9e661b1f06ae89d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::renderer::cpu::draw_quad_instance: FunctionTooLong \u2014 sugarloaf::renderer::cpu::draw_quad_instance 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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"be69d44da3a8691807f2d31ec8bd96355b10e2d6e8a2404273079d70b1a4cd69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Shared: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/event_loop/runner.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ed44b388cf443c9fa3c5efdd2953ae63a29f2a5b97c149413c450a29127983"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Renderer: TooManyFields \u2014 31 stored fields beside 11 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a79bf2174f066acf5566f836ab99e8d8ec7e66765af9bdbfb5d53d586f44be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WindowDelegate.set_fullscreen: MethodTooLong \u2014 set_fullscreen 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":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845ae7535421d7f6a4db4bf62cbe06d8d1d63bad310beeb089ea0f785a25b56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageCache.try_grow_texture_size: MethodTooLong \u2014 try_grow_texture_size runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f099dd1fdcbb0fc07be139b52f32f7c8a0cbfa38f571f0878ce54858b9368a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sugarloaf::text::build_ui_text_pipeline_vulkan: FunctionTooLong \u2014 sugarloaf::text::build_ui_text_pipeline_vulkan runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/text.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b873990c309dc20f34720633eba1b9ee7a0e8e12a2fd75a14e3501c27ce6f49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssistantOverlay.render: MethodTooLong \u2014 render 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":"frontends/rioterm/src/renderer/assistant.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bb426c0c38d7ea3f3692b5dbe7ea43c8bdfddbb374d85c0bf66cd958614397"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VulkanContext: ClassTooLong \u2014 402 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), 17 methods, 4 blocks, lines 114-1044. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/context/vulkan.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7471ba5c1e4f793a21f07c3300e088270954919af19588875cdf0dda5469a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 49 shared lines): sugarloaf/src/grid/vulkan.rs:1676-1767 | sugarloaf/src/renderer/vulkan.rs:824-904 | sugarloaf/src/renderer/vulkan.rs:996-1131 | sugarloaf/src/renderer/vulkan.rs:1223-1325 | sugarloaf/src/renderer/vulkan.rs:1529-1667 | sugarloaf/src/text.rs:1736-1857 \u2014 These 6 members are variants of one another: a block of 49 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"a175fdbfaf874ea3eb4c7bb6b238d81b101f079c480bb796e6c14688c4c30925"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 25 shared lines): sugarloaf/src/grid/cpu.rs:83-120 | sugarloaf/src/grid/metal.rs:203-250 | sugarloaf/src/grid/webgpu.rs:94-145 \u2014 These 3 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6cd0affe441d65be9b9d00d9282ba7cb9b7442a3a5dfb15e678902e182d459"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 19 shared lines): sugarloaf/src/grid/metal.rs:584-606 | sugarloaf/src/grid/vulkan.rs:885-907 | sugarloaf/src/grid/webgpu.rs:380-402 \u2014 These 3 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"110dcfb6cc99c27631cbf4fe899a1ed91a980b23beb11c0e8a719b8126489ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): sugarloaf/src/grid/metal.rs:770-855 | sugarloaf/src/text.rs:1289-1367 \u2014 These two members are variants of one another: 57 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf602deea523f91e1dc19a670d6aa6916c4a5028ba5b196b81dda31600eb708"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): sugarloaf/src/font/macos.rs:1293-1397 | sugarloaf/src/font/macos.rs:1423-1511 \u2014 These two members are variants of one another: 41 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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"840dbcd06d2a01c97ad71d4b276444f87de460834cec5d19c5ba0bce6ae5348e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): frontends/rioterm/src/bindings/mod.rs:1198-1253 | frontends/rioterm/src/bindings/mod.rs:1261-1323 \u2014 These two members are variants of one another: 35 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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2542c3f078c3a18095361af3dcc83f76f5c1bb576a6eb3a392ecec4586acfc5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): sugarloaf/src/grid/cpu.rs:597-644 | sugarloaf/src/text.rs:1918-1963 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e4a74b9ef9b552108a8fa6690de74d1ada18e1d5a47794c1909ccc719cc5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): sugarloaf/src/grid/cpu.rs:659-695 | sugarloaf/src/text.rs:1978-2012 \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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d4544d6964f5f45f6f4dd171405e9759f46b850ba9fe0a08a30beb44a9b2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): rio-vt/src/ansi/charset.rs:47-86 | rio-vt/src/crosswords/pos.rs:116-155 \u2014 These two members are one piece of code written twice and then edited apart: 40 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":"rio-vt/src/ansi/charset.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"419790cba1ee0fe8f99b57de151be973971005548763f644c9dbda5bd89ca3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rio-vt/src/performer/parser/mod.rs:1151-1176 | rio-vt/src/performer/parser/mod.rs:1183-1207 \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":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27afd22911b63aaad56c3e9e0d93bc1d26aa3beeb72efe8d89dae089b3b1a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): rio-window/src/platform_impl/windows/window.rs:153-164 | rio-window/src/platform_impl/windows/window.rs:182-193 | rio-window/src/platform_impl/windows/window.rs:347-359 | rio-window/src/platform_impl/windows/window.rs:368-393 | rio-window/src/platform_impl/windows/window.rs:747-759 | rio-window/src/platform_impl/windows/window.rs:934-946 | rio-window/src/platform_impl/windows/window.rs:957-978 | rio-window/src/platform_impl/windows/window.rs:1102-1114 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2fee06b91d882fbf6c8a84303c93ed8ebfabfc9267178f5031a45a44812c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): frontends/rioterm/src/renderer/assistant.rs:13-20 | frontends/rioterm/src/renderer/command_palette.rs:14-21 | frontends/rioterm/src/renderer/island.rs:1481-1488 | frontends/rioterm/src/renderer/search.rs:13-20 | rio-grid/src/lib.rs:1164-1171 | sugarloaf/src/grid/cpu.rs:517-524 \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":"frontends/rioterm/src/renderer/assistant.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7ded8b73876aad28d3ae6760be1233560866211bd34d6b07f5dabde877c6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): sugarloaf/src/renderer/batch.rs:121-220 | sugarloaf/src/renderer/batch.rs:237-286 | sugarloaf/src/renderer/batch.rs:303-411 | sugarloaf/src/renderer/batch.rs:425-441 | sugarloaf/src/renderer/batch.rs:456-481 \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":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39f83155d68c05713481bb353b0bad58c251d6fe39dd6466ecc77fa33f44c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): frontends/rioterm/src/layout/mod.rs:1439-1488 | frontends/rioterm/src/layout/mod.rs:1490-1539 | frontends/rioterm/src/layout/mod.rs:1541-1591 | frontends/rioterm/src/layout/mod.rs:1593-1643 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9773da8d2c46c8a1a8a7763d3d1eccfa16fdbe9d856c8cc5ef07b9fd1ea4f9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sugarloaf/src/renderer/vulkan.rs:321-384 | sugarloaf/src/renderer/vulkan.rs:403-481 | sugarloaf/src/renderer/vulkan.rs:494-547 | sugarloaf/src/renderer/vulkan.rs:558-617 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ea5bb913b86573f8e4917908f53765a2f4609f113375f0e9f4b2a16cff38f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): frontends/rioterm/src/hints.rs:702-749 | frontends/rioterm/src/screen/mod.rs:5093-5140 \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":"frontends/rioterm/src/hints.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91cd1587057275d89a78f9e38db77a54e93d6fa7aae8c879ac235ac6b36b466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): sugarloaf/src/grid/cpu.rs:598-638 | sugarloaf/src/text.rs:1919-1957 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/cpu.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5b1f8b2b0fedfaabe74a0ce91a626755254f06bf7df6b7253ab4d6a642a441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201334 lines \u00D7 3): corcovado/src/event_imp.rs:561-584 | corcovado/src/event_imp.rs:1027-1051 | corcovado/src/sys/unix/ready.rs:493-526 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/event_imp.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"823bb7ba4164fe1f155a7bcff81d8aec38f82ebff29ef1620d3be739522a7e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): rio-fonts/src/nerd_font.rs:443-476 | rio-fonts/src/nerd_font.rs:483-516 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"af16d1096933d42c35dc1d63f6c02d19b496b209e1385805cec1a0264e15e853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 2): frontends/rioterm/src/renderer/mod.rs:317-348 | libsugarloaf/src/capi.rs:863-890 \u2014 before extracting anything, compare \u0060frontends/rioterm/src/renderer/mod.rs\u0060 and \u0060libsugarloaf/src/capi.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf6ff4a0044744375c67099e449d34d47db2241fe46dd9a667075676eb78d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): sugarloaf/src/grid/cpu.rs:660-691 | sugarloaf/src/text.rs:1979-2008 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/cpu.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f3b6fdddb97bfa70b06453549f2543289591c4bbaf4eb4d366c2704610461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:1962-1992 | sugarloaf/src/renderer/mod.rs:2120-2150 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"51276927f863ac206e635e2ef78bc0adb5aa68c4042d6e5f7958d5bb9c98a9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 6): sugarloaf/src/grid/vulkan.rs:1726-1753 | sugarloaf/src/renderer/vulkan.rs:867-896 | sugarloaf/src/renderer/vulkan.rs:1091-1118 | sugarloaf/src/renderer/vulkan.rs:1285-1312 | sugarloaf/src/renderer/vulkan.rs:1627-1654 | sugarloaf/src/text.rs:1817-1844 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d383618f4d687daff74f22b1bd84750690229005b395dfe6b2e5077bb991f739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): frontends/rioterm/src/renderer/mod.rs:378-406 | libsugarloaf/src/capi.rs:907-934 \u2014 before extracting anything, compare \u0060frontends/rioterm/src/renderer/mod.rs\u0060 and \u0060libsugarloaf/src/capi.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"31497755accee9bcb7640275d3a4fc87659cf841e0f70997473964b696e736d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): sugarloaf/src/renderer/batch.rs:936-964 | sugarloaf/src/renderer/batch.rs:978-1006 \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":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"99220edeaba6bd657bb597c7fb628f32e81366fa0fa59d4adeb004add3b5c6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 3): sugarloaf/src/grid/cpu.rs:84-111 | sugarloaf/src/grid/metal.rs:204-228 | sugarloaf/src/grid/webgpu.rs:95-119 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"591c499c9d852af8cbb561695783d3dbaf65e7e297e7966e9853bab5b4b73cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): frontends/rioterm/src/context/mod.rs:1247-1273 | frontends/rioterm/src/context/mod.rs:1311-1337 \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":"frontends/rioterm/src/context/mod.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"207d95b44eeccda8a60862eee997bb6dbeca9b3afd38842d790bb92ce1d1f852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:1542-1568 | frontends/rioterm/src/layout/mod.rs:1594-1620 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee27ff98ca7bfbc1eb84a4818e611929fb2dd72f49999e9472c943619a35f6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:776-802 | rio-vt/src/crosswords/mod.rs:890-916 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe40c5225f23eb9bea9ca466b07e20caccc912c3b0445dc49827d2c5146e527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:298-324 | rio-window/src/platform_impl/linux/x11/mod.rs:569-595 \u2014 before extracting anything, compare \u0060rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs\u0060 and \u0060rio-window/src/platform_impl/linux/x11/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb0b09d56001aa6eddcf2d6d23f4d5afee09fc35285f7ef410cb1e621b474d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201327 lines \u00D7 2): sugarloaf/src/font/macos.rs:1337-1363 | sugarloaf/src/font/macos.rs:1463-1481 \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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b4e8840e1cf846c7984c6eb2e40f9f7d92a9d454dbddb721b99d82655ff304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): sugarloaf/src/renderer/cpu.rs:225-250 | sugarloaf/src/renderer/cpu.rs:884-910 \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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c929f3de0a278cfa6744ab38e7678d6f380bfb17b1eb4d493ca2ff312d008f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:361-387 | sugarloaf/src/renderer/image_cache/cache.rs:411-437 \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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0684d403bebea037283d330d864dca0d16e221a7cc440ef2a8b780239aba1239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:1440-1465 | frontends/rioterm/src/layout/mod.rs:1491-1516 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78aeacd886f98a95a6407e6e7ac07a66971ddd58fa91e1a76380935fef747ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:5064-5089 | rio-vt/src/crosswords/mod.rs:5188-5212 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":5064}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad986f72fbcd2af07421c0288cd8723705de3ceb522cfba07d45fc13ba11f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201324 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:400-423 | sugarloaf/src/renderer/mod.rs:435-451 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880b7428eea9594a688ee6442d8ae0c2f52df657396a218cc112ffb45a48122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201323 lines \u00D7 14): rio-fonts/src/nerd_font.rs:1987-2009 | rio-fonts/src/nerd_font.rs:2031-2043 | rio-fonts/src/nerd_font.rs:2075-2087 | rio-fonts/src/nerd_font.rs:2096-2108 | rio-fonts/src/nerd_font.rs:2117-2129 | rio-fonts/src/nerd_font.rs:2146-2158 | rio-fonts/src/nerd_font.rs:2175-2187 | rio-fonts/src/nerd_font.rs:2227-2239 | rio-fonts/src/nerd_font.rs:2801-2813 | rio-fonts/src/nerd_font.rs:2898-2910 | rio-fonts/src/nerd_font.rs:2952-2964 | rio-fonts/src/nerd_font.rs:2993-3005 | rio-fonts/src/nerd_font.rs:3015-3027 | rio-fonts/src/nerd_font.rs:3087-3099 \u2014 all 14 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9bca4ec021de84965882e79b265ba69b6b419b35e033c8f3f17db578779090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): frontends/rioterm/src/renderer/island.rs:1416-1437 | frontends/rioterm/src/renderer/search.rs:271-293 \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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fb439f154cb3093b72728046377599d1ea1640f1cd70c24ea81c04a2df72fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): sugarloaf/src/grid/metal.rs:831-853 | sugarloaf/src/text.rs:1347-1365 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb619ca4046c1bbf3f8118544d67ffd7ce6aeeb6a2b7fdce3272de94dccf7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1598-1618 | sugarloaf/src/text.rs:1764-1786 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba937425005e5c3972fcb95a43ca11da3bd4bb6c68ffc1c754e5f20c5a46850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:937-959 | sugarloaf/src/renderer/mod.rs:1316-1333 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4adad324018cec98ece8c854003264bc863748d95f8e717bd73703e28d9f797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): sugarloaf/src/text.rs:577-598 | sugarloaf/src/text.rs:622-644 \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":"sugarloaf/src/text.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3921cb85770d105d7e362f73368fc93b5b921cfb965502e8993e28d0bb995725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): frontends/rioterm/src/context/mod.rs:1219-1240 | frontends/rioterm/src/context/mod.rs:1341-1362 \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":"frontends/rioterm/src/context/mod.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac1492b1cbc394b2718deb6c6834f5bce81dd275087c37c5dae8ba5fee21664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:235-256 | rio-window/src/platform_impl/linux/x11/mod.rs:506-527 \u2014 before extracting anything, compare \u0060rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs\u0060 and \u0060rio-window/src/platform_impl/linux/x11/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86423ad330aabca0ecc4b64e0774adccc5cbac8001bd02ce944b82ffe3bf87a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): sugarloaf/src/components/filters/builtin/mod.rs:58-78 | sugarloaf/src/components/filters/builtin/mod.rs:100-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/components/filters/builtin/mod.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8685d6db4bb7971fa44f5a01d7e255de5dded820094afd7ee94135935254dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 21): rio-fonts/src/nerd_font.rs:699-719 | rio-fonts/src/nerd_font.rs:798-810 | rio-fonts/src/nerd_font.rs:834-846 | rio-fonts/src/nerd_font.rs:942-954 | rio-fonts/src/nerd_font.rs:1031-1043 | rio-fonts/src/nerd_font.rs:1076-1088 | rio-fonts/src/nerd_font.rs:1219-1231 | rio-fonts/src/nerd_font.rs:1246-1258 | rio-fonts/src/nerd_font.rs:1389-1401 | rio-fonts/src/nerd_font.rs:1807-1819 | rio-fonts/src/nerd_font.rs:1870-1882 | rio-fonts/src/nerd_font.rs:2137-2149 | rio-fonts/src/nerd_font.rs:2218-2230 | rio-fonts/src/nerd_font.rs:2418-2430 | rio-fonts/src/nerd_font.rs:2480-2492 | rio-fonts/src/nerd_font.rs:2506-2518 | rio-fonts/src/nerd_font.rs:2560-2572 | rio-fonts/src/nerd_font.rs:2627-2639 | rio-fonts/src/nerd_font.rs:2661-2673 | rio-fonts/src/nerd_font.rs:2766-2778 | rio-fonts/src/nerd_font.rs:2792-2804 \u2014 all 21 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20e2487195944a82528c5f3918508d8c74385dccb60d993d57c47a1c6a78f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): frontends/rioterm/src/renderer/island.rs:1304-1324 | frontends/rioterm/src/renderer/island.rs:1336-1355 \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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9762c7b063cc685612dcc68223d47dc659b4ad36c91973b071d251a1d87ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:1875-1892 | rio-vt/src/crosswords/mod.rs:3893-3913 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"69634cb328ff4b7705daf3dd69923b3b9edc9f94f66f9a4e4da3863cda62196b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rio-window/src/keyboard.rs:102-122 | rio-window/src/keyboard.rs:157-177 \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":"rio-window/src/keyboard.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c67a089f75af6110407fc8f115b479173346e1cab67272d46caafedbd916eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): sugarloaf/src/font/mod.rs:628-648 | sugarloaf/src/font/mod.rs:692-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/mod.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e692ba3b0909f0a1fbd91d9e1d2516c12ecbf44c296b8ca17d23d565c17a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): rio-fonts/src/nerd_font.rs:454-473 | rio-fonts/src/nerd_font.rs:494-513 | rio-fonts/src/nerd_font.rs:658-677 | rio-fonts/src/nerd_font.rs:682-701 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff1c2bfc36783198ab04d445189d6660c18bbf4f032048cd7989b9562083d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): rio-fonts/src/nerd_font.rs:1663-1682 | rio-fonts/src/nerd_font.rs:2107-2126 | rio-fonts/src/nerd_font.rs:2942-2961 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24d8fd62ddbb13f2d804bb565327eb37e83fc93d6238e0b950ea9dfe4d1bfd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rio-vt/src/ansi/kitty_graphics_protocol.rs:1400-1419 | rio-vt/src/ansi/kitty_graphics_protocol.rs:1515-1534 \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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54150b4810b69ae7b2a9c495edee6580402690e2488beac0e5c5059c491a5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): sugarloaf/src/grid/metal.rs:585-603 | sugarloaf/src/grid/vulkan.rs:886-904 | sugarloaf/src/grid/webgpu.rs:381-399 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/grid/vulkan.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da627591cef1796b4dc223c7a84c337349bf4b99621e2e0c1f0c2c5c921cc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 3): sugarloaf/src/renderer/vulkan.rs:1065-1078 | sugarloaf/src/renderer/vulkan.rs:1261-1274 | sugarloaf/src/text.rs:1788-1806 \u2014 before extracting anything, compare \u0060sugarloaf/src/renderer/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11df356c9f16fca622d47a9ddc5f261c3dc1129ffec1588d11cb629cd616cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): rio-grid/src/lib.rs:3200-3217 | sugarloaf/src/text.rs:1254-1272 \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":"rio-grid/src/lib.rs"},"region":{"startLine":3200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f19e60b317b922207a46e8325de91c357755e909613e66d3c2085bcf997e3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): rio-window/src/platform_impl/windows/event_loop.rs:283-301 | rio-window/src/platform_impl/windows/event_loop.rs:351-367 \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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e6a147d44d84f206a18c987f631e31f8480d8aa54972be684a9054c16ef7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): sugarloaf/src/grid/metal.rs:789-804 | sugarloaf/src/text.rs:1312-1330 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6974dd2745e856dd3fb3876f7bf271174a877ddc5660c2209e7258e2930412d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): sugarloaf/src/grid/metal.rs:806-824 | sugarloaf/src/text.rs:1327-1340 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"488a78f90d4cf5384ee115c17228ea1245e5e4e0115743475926194447e94bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): sugarloaf/src/renderer/batch.rs:199-217 | sugarloaf/src/renderer/batch.rs:388-405 \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":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"06972ccabb092bfb23a2f3e61f48ee73f513a4ec42f2d178e2867ec28d7c1983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 7): rio-fonts/src/nerd_font.rs:1230-1247 | rio-fonts/src/nerd_font.rs:1855-1871 | rio-fonts/src/nerd_font.rs:2384-2401 | rio-fonts/src/nerd_font.rs:2402-2419 | rio-fonts/src/nerd_font.rs:2464-2481 | rio-fonts/src/nerd_font.rs:2544-2561 | rio-fonts/src/nerd_font.rs:2699-2716 \u2014 all 7 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6350a27eaf366fe8cac6a4cbfc23ce9a3812356fb13dea9c6ac9bda7c82b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): sugarloaf/src/renderer/mod.rs:331-345 | sugarloaf/src/renderer/mod.rs:355-369 | sugarloaf/src/renderer/mod.rs:483-500 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3199a9b55190b8983e26cbb6f7d41c32355e10116ece01a92e03e9aa78ce414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rio-grid/src/lib.rs:1977-1994 | rio-grid/src/lib.rs:2070-2087 \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":"rio-grid/src/lib.rs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c195ed7a575ef02a476f08794bfb576715dad2ad94537b421f7f2bea9f8335a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rio-grid/src/lib.rs:2368-2385 | rio-grid/src/lib.rs:2684-2701 \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":"rio-grid/src/lib.rs"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969a13f6251d7ff3d8bad7dc332ce45dde7f42f8b8d8bcaa721af963d6b3c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rio-vt/src/ansi/charset.rs:69-86 | rio-vt/src/crosswords/pos.rs:138-155 \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":"rio-vt/src/ansi/charset.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab2e751040d0ec77514f5bb1f0fa987aa806633d108d11369037567d0bbc07c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:1780-1797 | rio-vt/src/crosswords/mod.rs:3653-3669 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b7e2b37c103fa3daaea5a808fca8f8c707b3da0d33035e39d26836366e6986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sugarloaf/src/font/macos.rs:325-342 | sugarloaf/src/font/macos.rs:387-404 \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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d42613ce28aa4ecb484ca07e1e1ee1cf9e9df5b3294009645eb10dd85c254c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): rio-fonts/src/nerd_font.rs:2086-2102 | rio-fonts/src/nerd_font.rs:2208-2224 | rio-fonts/src/nerd_font.rs:2238-2254 | rio-fonts/src/nerd_font.rs:2974-2990 | rio-fonts/src/nerd_font.rs:3077-3093 \u2014 all 5 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e56788d5eeb1efd354bc298e02bc6fc24772cc52a93a34fd3a7932717c59e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): rio-fonts/src/nerd_font.rs:435-451 | rio-fonts/src/nerd_font.rs:475-491 | rio-fonts/src/nerd_font.rs:651-667 | rio-fonts/src/nerd_font.rs:675-691 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6c6496ec4a07259c45c27e2becf58a30b4de7e83348d497b6713eec6c55128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rio-fonts/src/nerd_font.rs:2010-2026 | rio-fonts/src/nerd_font.rs:2043-2059 | rio-fonts/src/nerd_font.rs:2147-2163 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"2536407f7bb5076afc596a97f8dde74b1ca68e83190dd475f79a5b0185f6e904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): rio-fonts/src/nerd_font.rs:2056-2071 | rio-fonts/src/nerd_font.rs:2119-2135 | rio-fonts/src/nerd_font.rs:2995-3011 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f0fad288f4e98981ae20a28960d1d0ace05477b5ce97b1b64048ef3c1c125e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rio-window/src/platform_impl/web/web_sys/event.rs:202-218 | rio-window/src/platform_impl/web/web_sys/event.rs:221-237 \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":"rio-window/src/platform_impl/web/web_sys/event.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3fa4223a349896ae46e422e58d60b6405f1f640ed218108c55752aba4b6910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sugarloaf/src/grid/cpu.rs:376-392 | sugarloaf/src/grid/cpu.rs:429-445 \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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a22bd5721ea9f8aafae5812141fc808dd30d9841344850617bae950cafde450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:327-343 | sugarloaf/src/grid/vulkan.rs:365-381 \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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"618044fda8fa9cca9c3070ee2edb7c103f81aa544d9ddf382c2c0fa7e4c13e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:392-408 | sugarloaf/src/renderer/mod.rs:515-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f2f3fa873c6dd6cd9e80c46ad042098a5c2d9cc4db2021236777f0ed72df41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:911-927 | sugarloaf/src/renderer/mod.rs:1290-1306 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a72df04166c1cf1de373d281e3c6a346245e95a32d6cc3a9fceb8a4049d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:1017-1033 | sugarloaf/src/renderer/vulkan.rs:1552-1568 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c10dc2b5bbd5ea1a45cb31c534fc7d3f13c1d048226b9fe26c7439c5694b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): frontends/rioterm/src/layout/mod.rs:1450-1465 | frontends/rioterm/src/layout/mod.rs:1501-1516 | frontends/rioterm/src/layout/mod.rs:1553-1568 | frontends/rioterm/src/layout/mod.rs:1605-1620 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc0fe4249da1699d5e4863fc26487763855f4b19fa8aa1e9cbe63e35f9b76b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 3): sugarloaf/src/renderer/mod.rs:2861-2876 | sugarloaf/src/renderer/mod.rs:2912-2922 | sugarloaf/src/renderer/mod.rs:3027-3037 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8f2ecbb6c75f5c9fd9a1dea9aabf62f3430afaaa861919dbba900a1cece0f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): sugarloaf/src/renderer/vulkan.rs:322-337 | sugarloaf/src/renderer/vulkan.rs:404-418 | sugarloaf/src/renderer/vulkan.rs:559-572 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ca07e4a184c8da65bebe7775eb24e79c729ee26d67195e38fe4fa80951199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): frontends/rioterm/src/application.rs:382-397 | frontends/rioterm/src/application.rs:469-481 \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":"frontends/rioterm/src/application.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b492e44d7ef7083a9503363690fb1fe3096e227335f10a12f3f44ed20d6c6e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rio-fonts/src/nerd_font.rs:1917-1932 | rio-fonts/src/nerd_font.rs:1958-1973 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc91e83e51469808a3e36b159c67c9b7efdd8d388ad21b2bb5e1cd63d86a9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rio-vt/src/ansi/charset.rs:48-63 | rio-vt/src/crosswords/pos.rs:117-132 \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":"rio-vt/src/ansi/charset.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd00d979ed78a4c99721da5aa8045307c2b5f8715f4df2d363189ec68b3897f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:1053-1068 | sugarloaf/src/renderer/vulkan.rs:1588-1603 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"befb0c60df7fb14dbe18b65c8526de7ad79c71af08aef14f99af9139272db925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 8): rio-fonts/src/nerd_font.rs:782-796 | rio-fonts/src/nerd_font.rs:818-832 | rio-fonts/src/nerd_font.rs:926-940 | rio-fonts/src/nerd_font.rs:1042-1056 | rio-fonts/src/nerd_font.rs:1060-1074 | rio-fonts/src/nerd_font.rs:1375-1388 | rio-fonts/src/nerd_font.rs:2447-2460 | rio-fonts/src/nerd_font.rs:2742-2756 \u2014 all 8 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"1340928ea1467abf495386ae1aceec5adc1f29a36c4dc943be22311f4784760a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): sugarloaf/src/renderer/vulkan.rs:1059-1071 | sugarloaf/src/renderer/vulkan.rs:1255-1267 | sugarloaf/src/renderer/vulkan.rs:1594-1608 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c9baa990f9ad0e9e2e8d2720aeaccb4799083b342cc639e7e4d765038a863e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): frontends/rioterm/src/renderer/mod.rs:1029-1043 | librio/src/render_state.rs:395-408 \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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb81eedf1779e07941b81abc4996c5fd0a882a32fca4c84706d1ac6045214590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): frontends/rioterm/src/router/mod.rs:573-587 | frontends/rioterm/src/router/mod.rs:607-621 \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":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2442399c07111e4296ff4f425f49d833155bfbf9bb9ced4441c412cc1035e68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): frontends/rioterm/src/screen/touch.rs:148-162 | frontends/rioterm/src/screen/touch.rs:228-242 \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":"frontends/rioterm/src/screen/touch.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f615af5e77210ee4d84ce52e953da6268482097c7750d002f3cb57dd1f05ea81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rio-fonts/src/nerd_font.rs:2874-2888 | rio-fonts/src/nerd_font.rs:3055-3069 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e601dbcc90f4f2585a4ec1a04d354fbbe41a92e5d24f776ff71d4f94381624b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rio-graphics/src/lib.rs:344-358 | rio-graphics/src/lib.rs:409-423 \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":"rio-graphics/src/lib.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee86152c5a8eb4c80ded357cd8ccef63ab6a2e648d347139997f46158d036a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:1560-1574 | sugarloaf/src/renderer/vulkan.rs:1578-1592 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"7def1cd7f974e0160c4810dbd9fbd2e0fdc4aaf9a85a92d82bcf83b6f18d21ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): sugarloaf/src/text.rs:600-614 | sugarloaf/src/text.rs:646-657 \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":"sugarloaf/src/text.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f92a1599b88423995c9b0f241a64e030ec5f747c79ea189e2f56a8a78a172b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): teletypewriter/src/windows/pipes.rs:132-146 | teletypewriter/src/windows/pipes.rs:320-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/src/windows/pipes.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc60f7af88bc160b36f5d16748c3f668ff61eb07cffe753aedead0bd8d7c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 28): rio-fonts/src/nerd_font.rs:701-714 | rio-fonts/src/nerd_font.rs:792-804 | rio-fonts/src/nerd_font.rs:828-840 | rio-fonts/src/nerd_font.rs:936-948 | rio-fonts/src/nerd_font.rs:1033-1046 | rio-fonts/src/nerd_font.rs:1052-1064 | rio-fonts/src/nerd_font.rs:1070-1082 | rio-fonts/src/nerd_font.rs:1221-1234 | rio-fonts/src/nerd_font.rs:1240-1252 | rio-fonts/src/nerd_font.rs:1391-1404 | rio-fonts/src/nerd_font.rs:1809-1822 | rio-fonts/src/nerd_font.rs:1864-1876 | rio-fonts/src/nerd_font.rs:2139-2152 | rio-fonts/src/nerd_font.rs:2160-2172 | rio-fonts/src/nerd_font.rs:2220-2233 | rio-fonts/src/nerd_font.rs:2394-2406 | rio-fonts/src/nerd_font.rs:2412-2424 | rio-fonts/src/nerd_font.rs:2456-2468 | rio-fonts/src/nerd_font.rs:2474-2486 | rio-fonts/src/nerd_font.rs:2500-2512 | rio-fonts/src/nerd_font.rs:2554-2566 | rio-fonts/src/nerd_font.rs:2621-2633 | rio-fonts/src/nerd_font.rs:2647-2659 | rio-fonts/src/nerd_font.rs:2663-2676 | rio-fonts/src/nerd_font.rs:2709-2721 | rio-fonts/src/nerd_font.rs:2734-2746 | rio-fonts/src/nerd_font.rs:2768-2781 | rio-fonts/src/nerd_font.rs:2794-2807 \u2014 all 28 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e08e3860cd87ec6eb76827979d1e8e61821c8ae8be0f79ae41f9512c1f6428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): rio-fonts/src/nerd_font.rs:1692-1705 | rio-fonts/src/nerd_font.rs:2131-2143 | rio-fonts/src/nerd_font.rs:2168-2181 | rio-fonts/src/nerd_font.rs:2986-2999 | rio-fonts/src/nerd_font.rs:3071-3083 \u2014 all 5 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fa1f6b4edb1a40ec238273014e624fb646c401cfa544f77e73208548f19257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): sugarloaf/src/renderer/batch.rs:122-134 | sugarloaf/src/renderer/batch.rs:238-251 | sugarloaf/src/renderer/batch.rs:304-316 | sugarloaf/src/renderer/batch.rs:426-438 | sugarloaf/src/renderer/batch.rs:457-469 \u2014 all 5 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":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cc609e316b89629a8d5d7bcc2896eb7b80e46800aeae334eccd66b33d8e0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): frontends/rioterm/src/context/title.rs:133-146 | frontends/rioterm/src/context/title.rs:158-169 | frontends/rioterm/src/context/title.rs:177-188 \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":"frontends/rioterm/src/context/title.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"541edb2f5e293cb070112322a5e6fa952e56474df85e75777d94e1dbad201a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:790-803 | frontends/rioterm/src/layout/mod.rs:816-829 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"b672890ab8e2cf8d17ce9978f7496aa16d041c009ae8ab81220b93ab8828be16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:850-863 | frontends/rioterm/src/layout/mod.rs:876-889 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1501e8436f52df3fb580272a0e479f13d4f530f56d33d3783d04d59d02c6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:1475-1488 | frontends/rioterm/src/layout/mod.rs:1526-1539 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7618b7b4e69b8e0a772815d268697d1ba769b350724f3e0423736911bf094f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:1578-1591 | frontends/rioterm/src/layout/mod.rs:1630-1643 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5d87a2cc59f952513610d392a014bee8b3791b6362d78e710441fd8b21a995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rio-fonts/src/nerd_font.rs:1643-1656 | rio-fonts/src/nerd_font.rs:2752-2764 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eca2cc13f61551b171a40426e29ebf4937f2cbc4d74c9f348988d9b18e396a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rio-fonts/src/nerd_font.rs:1728-1741 | rio-fonts/src/nerd_font.rs:1801-1813 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3817188daa22aae770c220b45c966e333c53bf4782da662f3f6e463efca05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rio-grid/src/lib.rs:2846-2859 | rio-grid/src/lib.rs:2915-2928 \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":"rio-grid/src/lib.rs"},"region":{"startLine":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"58528ea0cb515e17aac98ad5d9b5b2a5bb842c6dab4aa6064b720be41cc59973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rio-window/src/platform_impl/linux/x11/event_processor.rs:1757-1770 | rio-window/src/platform_impl/linux/x11/event_processor.rs:1773-1785 \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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea72a0a3f3c094bf33b5abf7dfd44ab71a3babb85575d1c63199226cba6d7652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sugarloaf/src/font/macos.rs:743-756 | sugarloaf/src/font/macos.rs:760-773 \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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18cdaa4e4f610e553d0a62a378e7585c171f38a1b33c4ca149ad7d90e3bb405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sugarloaf/src/sprite/box_drawing.rs:366-379 | sugarloaf/src/sprite/box_drawing.rs:392-405 \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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"79717255c2d10233f444f0c903c3f55b0cd5ff50427de410b14efd1af83ccb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 5): sugarloaf/src/renderer/vulkan.rs:852-864 | sugarloaf/src/renderer/vulkan.rs:1077-1088 | sugarloaf/src/renderer/vulkan.rs:1273-1282 | sugarloaf/src/renderer/vulkan.rs:1614-1624 | sugarloaf/src/text.rs:1805-1814 \u2014 before extracting anything, compare \u0060sugarloaf/src/renderer/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e8f3af6943af11a245ed802e4d6dbfe56ac03751da70c49911bed71b91f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): sugarloaf/src/renderer/vulkan.rs:1002-1014 | sugarloaf/src/renderer/vulkan.rs:1229-1240 | sugarloaf/src/renderer/vulkan.rs:1537-1549 | sugarloaf/src/text.rs:1743-1755 \u2014 before extracting anything, compare \u0060sugarloaf/src/renderer/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9282a3585e52db6a39008a1c52e8dc78cec1106b4ca42a52823b75827c22f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rio-fonts/src/nerd_font.rs:2164-2176 | rio-fonts/src/nerd_font.rs:2246-2258 | rio-fonts/src/nerd_font.rs:2982-2994 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15db6f0cb64790efef73073df1e081a3c9a85fff7e896a8c090307e7213a535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 4): rio-fonts/src/nerd_font.rs:2301-2308 | rio-fonts/src/nerd_font.rs:2310-2322 | rio-fonts/src/nerd_font.rs:2325-2337 | rio-fonts/src/nerd_font.rs:2351-2363 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbde968342994574f43f0aff5fc93854a9c475464e881aa6b4cc082fb07d4e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 3): sugarloaf/src/grid/metal.rs:884-892 | sugarloaf/src/renderer/mod.rs:407-419 | sugarloaf/src/renderer/mod.rs:439-447 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3cae60f547a2a0624b8aee65b1b1f56a0012328a3388993ec9f696591ba0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201313 lines \u00D7 3): frontends/rioterm/src/screen/mod.rs:1567-1579 | frontends/rioterm/src/screen/mod.rs:1585-1597 | frontends/rioterm/src/screen/mod.rs:1602-1608 \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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2ad757058db81b60283e1c9b1485a0fb9335451f659e8b4b1630cb2eb43365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): librio/src/render_state.rs:270-282 | rio-vt/src/crosswords/grid/mod.rs:700-712 \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":"librio/src/render_state.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5967737d65d8737e5983c34772938ed1e4ee2ada7fcf1e820df0732912e1179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rio-fonts/src/nerd_font.rs:1370-1382 | rio-fonts/src/nerd_font.rs:2616-2628 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb3d0e33e6590025aaf27f731654a5d21515980d0eb4d18029c5f0045c3eafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rio-fonts/src/nerd_font.rs:2247-2259 | rio-fonts/src/nerd_font.rs:3058-3070 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0669311197d0a4b29f585c9b5ba96110addfb25460d821a90052217af4194de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:204-216 | rio-window/src/platform_impl/linux/x11/mod.rs:470-482 \u2014 before extracting anything, compare \u0060rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs\u0060 and \u0060rio-window/src/platform_impl/linux/x11/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5df9d6abb34c27ddeabbad3bd09413becdf21656df644194d34954d52a8b6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rio-window/src/platform_impl/linux/x11/ime/context.rs:273-285 | rio-window/src/platform_impl/linux/x11/ime/context.rs:333-345 \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":"rio-window/src/platform_impl/linux/x11/ime/context.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"65357c422e7516f2202a6c92afa1e368aff1f2f2974a2911e74eb9c94e71c3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sugarloaf/src/grid/webgpu.rs:693-705 | sugarloaf/src/text.rs:1534-1546 \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":"sugarloaf/src/grid/webgpu.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b05bb2716509bd0ad2dda3e3872892915ca2a4eeba5bd8a49a2f6915056b0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:235-247 | sugarloaf/src/renderer/image_cache/cache.rs:254-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1f097a64188b409970d921a78fb3f01ed57b6d72fc7131f39ee3434ef348c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:631-643 | sugarloaf/src/renderer/mod.rs:2045-2057 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"5932392627872e180a347b818377f614eb6572bea142295eace007707fbfa894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): sugarloaf/src/text.rs:379-389 | sugarloaf/src/text.rs:1225-1237 \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":"sugarloaf/src/text.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"795305d54a20e1753cdd6c5a33a75391e9fe6a26b6fdaf94e7a1790fc55ea0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): teletypewriter/src/unix/mod.rs:312-324 | teletypewriter/src/unix/mod.rs:337-349 \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":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"53420cbaa708e47f3af768236da4019c0932c582931c73cf5ead3a5018b2f82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8): rio-fonts/src/nerd_font.rs:788-799 | rio-fonts/src/nerd_font.rs:824-835 | rio-fonts/src/nerd_font.rs:932-943 | rio-fonts/src/nerd_font.rs:1048-1059 | rio-fonts/src/nerd_font.rs:1066-1077 | rio-fonts/src/nerd_font.rs:2156-2167 | rio-fonts/src/nerd_font.rs:2452-2463 | rio-fonts/src/nerd_font.rs:2748-2759 \u2014 all 8 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62736bdfdeeba27d15cb83770c89f89d1871593108438e771961ea5895d6f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): rio-fonts/src/nerd_font.rs:779-790 | rio-fonts/src/nerd_font.rs:815-826 | rio-fonts/src/nerd_font.rs:923-934 | rio-fonts/src/nerd_font.rs:1039-1050 | rio-fonts/src/nerd_font.rs:1057-1068 | rio-fonts/src/nerd_font.rs:1842-1853 | rio-fonts/src/nerd_font.rs:2739-2750 \u2014 all 7 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4f805303563ce3eb6a1f24cf1acf0b1f149c382a6244695bd9356fda0b1e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): rio-fonts/src/nerd_font.rs:1227-1238 | rio-fonts/src/nerd_font.rs:1362-1373 | rio-fonts/src/nerd_font.rs:1640-1651 | rio-fonts/src/nerd_font.rs:2399-2410 | rio-fonts/src/nerd_font.rs:2461-2472 | rio-fonts/src/nerd_font.rs:2541-2552 | rio-fonts/src/nerd_font.rs:2696-2707 \u2014 all 7 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee3b3f80e6ebfa06046992da92cfae29cf8d3575e671fb5f72fef73ab88bcbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 6): sugarloaf/src/grid/vulkan.rs:1700-1711 | sugarloaf/src/renderer/vulkan.rs:847-858 | sugarloaf/src/renderer/vulkan.rs:1073-1082 | sugarloaf/src/renderer/vulkan.rs:1269-1278 | sugarloaf/src/renderer/vulkan.rs:1610-1619 | sugarloaf/src/text.rs:1801-1810 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fc0c4a2e0de33fff164e12dd87ca2c12dbb820b8691b1ccc91a13858c50c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): rio-fonts/src/nerd_font.rs:2165-2176 | rio-fonts/src/nerd_font.rs:2247-2258 | rio-fonts/src/nerd_font.rs:2877-2888 | rio-fonts/src/nerd_font.rs:2983-2994 | rio-fonts/src/nerd_font.rs:3058-3069 \u2014 all 5 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"67921aaae5ac00844bd03c0c7289a99f71134c24b29f3934a57184cf947e6ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): rio-fonts/src/nerd_font.rs:1723-1734 | rio-fonts/src/nerd_font.rs:2172-2183 | rio-fonts/src/nerd_font.rs:2990-3001 | rio-fonts/src/nerd_font.rs:3074-3085 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca22fae52f72ff57b683f82ec9dce59185f3b440d6130d5aaa4b564288b0d72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): sugarloaf/src/grid/metal.rs:839-850 | sugarloaf/src/renderer/mod.rs:526-536 | sugarloaf/src/text.rs:1355-1362 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7fef6609c5fa67168c4fffd1b659fada13a80954adb05a5025bfbdbbed749e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): sugarloaf/src/text.rs:531-538 | sugarloaf/src/text.rs:599-610 | sugarloaf/src/text.rs:645-653 \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":"sugarloaf/src/text.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcf65b7110c0280f62b9da31316c798966dfc458ab95961d1a49156eff9838a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): frontends/rioterm/src/renderer/mod.rs:364-375 | libsugarloaf/src/capi.rs:897-904 \u2014 before extracting anything, compare \u0060frontends/rioterm/src/renderer/mod.rs\u0060 and \u0060libsugarloaf/src/capi.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3e94cc500f83a86881c59a5b27d083afef6514ca50a1b40b40d6fc7ee23021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): rio-fonts/src/nerd_font.rs:392-403 | rio-fonts/src/nerd_font.rs:405-416 | rio-fonts/src/nerd_font.rs:417-426 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"916e347dc09e0e4197d9c9ae83ecd433d1e5e2c6febfcbbd617267f508c9f8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 3): rio-fonts/src/nerd_font.rs:583-594 | rio-fonts/src/nerd_font.rs:605-616 | rio-fonts/src/nerd_font.rs:627-633 \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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d574649eb1c45e620c4d9aa6bf80212f5e6ee71c569d44a8d7fb92ca817305c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rio-window/src/platform_impl/linux/common/xkb/keymap.rs:454-465 | rio-window/src/platform_impl/windows/keyboard.rs:1121-1132 \u2014 before extracting anything, compare \u0060rio-window/src/platform_impl/linux/common/xkb/keymap.rs\u0060 and \u0060rio-window/src/platform_impl/windows/keyboard.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fded06bba4576bd72a8ef08c4898927c4db5cb02cd569b16dece6ed45f3d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rio-window/src/platform_impl/linux/common/xkb/mod.rs:163-174 | rio-window/src/platform_impl/linux/common/xkb/mod.rs:184-195 \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":"rio-window/src/platform_impl/linux/common/xkb/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7855b65ad0381c2dfe8f473334b463c2d0e7c55c3d2b6de203a010ca34e744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rio-window/src/platform_impl/macos/window_delegate.rs:1284-1295 | rio-window/src/platform_impl/macos/window_delegate.rs:1309-1320 \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":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5679918a7d567acba1a539e29bd5237530801a3e35145d85b3dbd44774f2ca81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rio-window/src/platform_impl/windows/event_loop.rs:1465-1476 | rio-window/src/platform_impl/windows/event_loop.rs:1483-1494 \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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"61008fe00cd7633b688199bf84c8c1acf46cbc18fbec9ea5e127edcab1e49939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/font/macos.rs:1365-1376 | sugarloaf/src/font/macos.rs:1483-1494 \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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa0d796f0a73d87311357a12221b903542ecac3d90fcbc78fd8c7c4be3e2d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/font/mod.rs:320-331 | sugarloaf/src/font/mod.rs:383-394 \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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc015d577e7dfac242d72d0840b1cd44a7fe95d59b09494c92beff27baaa7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/grid/metal.rs:542-553 | sugarloaf/src/grid/vulkan.rs:847-858 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/grid/vulkan.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"edea0955e71e0f549f7c8423f1632efad6c07d1baade57d2d2003fe099c6b9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/grid/webgpu.rs:830-841 | sugarloaf/src/text.rs:1519-1530 \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":"sugarloaf/src/grid/webgpu.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa95e8b5ed48fd5d720e89edbedf8b46e7ef33829bf124314b7e120d9eaa4d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:156-167 | sugarloaf/src/renderer/image_cache/cache.rs:459-470 \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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bfb15af12224624668b7a209b4e176b3edee9a645607a21f54920af6dbaefc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:584-595 | sugarloaf/src/renderer/image_cache/cache.rs:650-661 \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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9899585fabe8034ef1252a475ea46a3d5e4d67443a3d7a3bb133dbd4df11320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:906-917 | sugarloaf/src/renderer/image_cache/cache.rs:934-945 \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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ae11aa2eaa6c5671f1eb2e68dfceefc17be73e807040299feb81d36233fa4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:375-386 | sugarloaf/src/renderer/mod.rs:499-509 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4508d1877baffdf7511459ae69806ada2f9529ebd31c58a3b4d804acfd28d264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:1242-1253 | sugarloaf/src/text.rs:1757-1768 \u2014 before extracting anything, compare \u0060sugarloaf/src/renderer/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c17bf791151825cd4de675647e464794a1c914fb727aebd515c3e4317bfb358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): rio-fonts/src/nerd_font.rs:441-451 | rio-fonts/src/nerd_font.rs:461-471 | rio-fonts/src/nerd_font.rs:481-491 | rio-fonts/src/nerd_font.rs:501-511 | rio-fonts/src/nerd_font.rs:657-667 | rio-fonts/src/nerd_font.rs:669-679 | rio-fonts/src/nerd_font.rs:681-691 \u2014 all 7 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":"rio-fonts/src/nerd_font.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e87c5c25ab11cc23dcc50c0fad49012e7fdb4ecbb6a734fc9b47f08dc7658f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): sugarloaf/src/grid/vulkan.rs:1680-1690 | sugarloaf/src/renderer/vulkan.rs:825-835 | sugarloaf/src/renderer/vulkan.rs:1000-1010 | sugarloaf/src/renderer/vulkan.rs:1227-1237 | sugarloaf/src/renderer/vulkan.rs:1535-1545 | sugarloaf/src/text.rs:1741-1751 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"545862f48c8306d323b5631573c44af5e3187ccf16e343c23b9405f1bf563e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): sugarloaf/src/renderer/vulkan.rs:325-337 | sugarloaf/src/renderer/vulkan.rs:407-418 | sugarloaf/src/renderer/vulkan.rs:495-505 | sugarloaf/src/renderer/vulkan.rs:562-572 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a4ab2330610b9cb0c500a690a8a5c99843e5266d2ec2b588d4519915855ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): sugarloaf/src/renderer/vulkan.rs:1023-1033 | sugarloaf/src/renderer/vulkan.rs:1047-1057 | sugarloaf/src/renderer/vulkan.rs:1558-1568 | sugarloaf/src/renderer/vulkan.rs:1576-1586 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd4ee20b3c233a651d716f419005ad39766fc92841b25408e749deed459edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): sugarloaf/src/renderer/vulkan.rs:1041-1051 | sugarloaf/src/renderer/vulkan.rs:1249-1259 | sugarloaf/src/renderer/vulkan.rs:1564-1574 | sugarloaf/src/renderer/vulkan.rs:1582-1592 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5cf6403cdaf7dd319f5596e88018b7dc9d49042ad66bd7e08b4598f9f56fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rio-window/src/platform_impl/windows/event_loop.rs:1937-1947 | rio-window/src/platform_impl/windows/event_loop.rs:1977-1987 | rio-window/src/platform_impl/windows/event_loop.rs:2017-2027 \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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b0cc38c1a2bbab688377c1aa8415f93d011f3a693d30b7121875f97d9fdf44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rio-window/src/platform_impl/windows/event_loop.rs:1957-1967 | rio-window/src/platform_impl/windows/event_loop.rs:1997-2007 | rio-window/src/platform_impl/windows/event_loop.rs:2037-2047 \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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1c3d81e6846d4b76b3faca583205db72b71f02ca04f9addecf7ae3fa953c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): sugarloaf/src/text.rs:584-594 | sugarloaf/src/text.rs:629-639 | sugarloaf/src/text.rs:716-726 \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":"sugarloaf/src/text.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db44deb543d9b0a0496b28f1f0816b022674d175415a8af63eaf27b951ba72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sugarloaf/src/font/macos.rs:968-978 | sugarloaf/src/font/macos.rs:1152-1162 \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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78a0938e8b6eb686427b242f350f5588099c9df80a9b3555217f5ccab4144ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sugarloaf/src/grid/metal.rs:563-573 | sugarloaf/src/grid/vulkan.rs:868-878 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/grid/vulkan.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5236d8dc180500d95257e4a457593424a997ef8b4ad4aff6730e80eb91d183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1488-1498 | sugarloaf/src/grid/vulkan.rs:1516-1524 \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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f6b448c585bb226c8a8dfbf5db9142d658b9072ecb27f635c1da071452d027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:368-378 | sugarloaf/src/renderer/vulkan.rs:603-613 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a299dc82e69e59cd70e9775fc7f7255c205054f10799fc8d7831f0d364f364d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sugarloaf/src/sprite/box_drawing.rs:321-331 | sugarloaf/src/sprite/box_drawing.rs:385-395 \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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bda9da29c7112d441a59e1927350bcda35182b6f75169de616bca79913a0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): sugarloaf/src/renderer/batch.rs:355-364 | sugarloaf/src/renderer/batch.rs:365-374 | sugarloaf/src/renderer/batch.rs:375-384 | sugarloaf/src/renderer/batch.rs:385-394 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6025dae27478fe60f2ce117b8afb620c724365c2093582650f52ddb36c8360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): sugarloaf/src/renderer/mod.rs:323-332 | sugarloaf/src/renderer/mod.rs:347-356 | sugarloaf/src/renderer/mod.rs:371-380 | sugarloaf/src/renderer/mod.rs:495-504 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0607f405473e416938a5c2df8d43390ef2d0d04cc8c19a5ccfec526634cf71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): frontends/rioterm/src/screen/mod.rs:2564-2570 | frontends/rioterm/src/screen/mod.rs:2607-2616 | frontends/rioterm/src/screen/mod.rs:2652-2658 \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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c06fb87bde45307284b4a11fec245c5dc175cf3ae36805da16cb5054a95747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): sugarloaf/src/renderer/cpu.rs:102-111 | sugarloaf/src/renderer/cpu.rs:121-129 | sugarloaf/src/renderer/cpu.rs:144-152 \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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8a80a4be2c1045fb4dcaddf01e12d93a77b6e8728eab444bec661b469a8748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): sugarloaf/src/renderer/mod.rs:412-423 | sugarloaf/src/renderer/mod.rs:442-451 | sugarloaf/src/renderer/mod.rs:530-540 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c07c0a6a0c7b4996c0b7aeb86cb9cadef70e1ef6811b2c490b000b13cc64347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): frontends/rioterm/src/bindings/mod.rs:1222-1231 | frontends/rioterm/src/bindings/mod.rs:1290-1299 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d18150b09dc66adc7b9cfe175e198ae853010d2a9e33dc2123e8be109eecd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): frontends/rioterm/src/hints.rs:213-222 | frontends/rioterm/src/hints.rs:265-273 \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":"frontends/rioterm/src/hints.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcbf09b89d45ee570267fbbe722496a9c9ce7f0c4204e4295059b2a9154f279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:5123-5132 | rio-vt/src/crosswords/mod.rs:5230-5239 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7f8a8b71e7671109dd6e441a6585732dcad967a7d15cded19cf0cd54a7a39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-window/src/platform_impl/linux/common/xkb/keymap.rs:366-375 | rio-window/src/platform_impl/windows/keyboard.rs:1109-1118 \u2014 before extracting anything, compare \u0060rio-window/src/platform_impl/linux/common/xkb/keymap.rs\u0060 and \u0060rio-window/src/platform_impl/windows/keyboard.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70529bd8875e78dc34641b38d14109b21b31eab00a18e64bb6ead2a373c8ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-window/src/platform_impl/windows/event_loop.rs:1683-1692 | rio-window/src/platform_impl/windows/event_loop.rs:1725-1734 \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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"778fedd6df6ef5876c04b017787eee0406812ef7aee6dc9b244d54d807bc9a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-window/src/platform_impl/windows/window.rs:240-249 | rio-window/src/platform_impl/windows/window.rs:302-311 \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":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"911866ae8cf9798d33031db0018fab15f7ac539495466a1c8673348842525e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-window/src/platform_impl/windows/window.rs:369-378 | rio-window/src/platform_impl/windows/window.rs:958-967 \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":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9aa258b47c884cb239eca4e0006d41c49c256ac816096cfa128ba1d7c6a7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-window/src/platform_impl/windows/window.rs:492-501 | rio-window/src/platform_impl/windows/window.rs:511-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"24531b675815cc1b32ca674bf0dbd7d122240aa680436c4051a0f43e2210ede2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sugarloaf/src/font/macos.rs:1302-1311 | sugarloaf/src/font/macos.rs:1450-1459 \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":"sugarloaf/src/font/macos.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a9bf6a8feb13d37a3429783fb9f3c75e0eea196d2562c311247c8341f73f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sugarloaf/src/font/metrics.rs:91-100 | sugarloaf/src/font/mod.rs:1287-1296 \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":"sugarloaf/src/font/metrics.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f413b3a280c898224f73b11ae1229bd3044121dc70d631b50101428c9eb0cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sugarloaf/src/font/mod.rs:653-662 | sugarloaf/src/font/mod.rs:716-725 \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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c79a92edd068fc8528bd5f5c04c9f28f5da25c1303650d3457d07313d170b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1552-1561 | sugarloaf/src/text.rs:1716-1725 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"530351b7160e8095cc56cfe663c56eef5e043aaa80beb4b75ca7b15a146ec975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:193-202 | sugarloaf/src/renderer/image_cache/cache.rs:573-581 \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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3996a589147b28cae24423c26a6fff2aa280fa5cf64e23d1221c7f46e1ab15fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sugarloaf/src/renderer/image_cache/colr_raster.rs:460-469 | sugarloaf/src/renderer/image_cache/colr_raster.rs:485-494 \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":"sugarloaf/src/renderer/image_cache/colr_raster.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf1026725aaa7ce7623288ce88eb77d32a41731085269fc1db4baa1648691d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:925-934 | sugarloaf/src/renderer/vulkan.rs:1172-1181 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cfa143c53001cc95da564f39e829c9b51d8958c8bd1affb582a109a87341db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): sugarloaf/src/grid/cpu.rs:601-609 | sugarloaf/src/grid/cpu.rs:660-667 | sugarloaf/src/text.rs:1922-1929 | sugarloaf/src/text.rs:1979-1986 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/cpu.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"408ac07e6a493ecc41006569d7b83997d3a8344ba9922974c1fc935e769ead8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): sugarloaf/src/grid/vulkan.rs:1383-1391 | sugarloaf/src/renderer/vulkan.rs:911-919 | sugarloaf/src/renderer/vulkan.rs:1142-1150 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a5afb3ffe1e2fc6d6aee211944c609bfbf474d7553eb7947233c8468337328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): sugarloaf/src/renderer/batch.rs:254-262 | sugarloaf/src/renderer/batch.rs:264-272 | sugarloaf/src/renderer/batch.rs:274-282 \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":"sugarloaf/src/renderer/batch.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ed33e82f3155a602dc0558c866efbce30367f4e56a16d482b98c145b4e479b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): frontends/rioterm/src/renderer/assistant.rs:182-190 | frontends/rioterm/src/renderer/search.rs:133-141 \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":"frontends/rioterm/src/renderer/assistant.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0847ea958161a7d35fce238e9b12fb2cf67d3ae8379892730dffd6bdd1d6959a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): frontends/rioterm/src/screen/mod.rs:885-893 | frontends/rioterm/src/screen/mod.rs:4826-4832 \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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca4caf58d0c4f3620a6c3f9e1ffcf454d4fcbd79b3417cf9472c1abfc029763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:1843-1851 | rio-vt/src/crosswords/mod.rs:1919-1927 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3171e665ce1c03356612bc48b66d6a33e144c76026b5175ad39a20b124be3ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rio-vt/src/performer/parser/mod.rs:1039-1047 | rio-vt/src/performer/parser/mod.rs:1114-1122 \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":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1202d667991fb7ae8de1e2f5c8794dab2fc9cfc12019f6c03ac7ea88db11abd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rio-window/src/platform_impl/linux/common/xkb/keymap.rs:309-317 | rio-window/src/platform_impl/windows/keyboard.rs:1005-1013 \u2014 before extracting anything, compare \u0060rio-window/src/platform_impl/linux/common/xkb/keymap.rs\u0060 and \u0060rio-window/src/platform_impl/windows/keyboard.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"rio-window/src/platform_impl/linux/common/xkb/keymap.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95c42a5414e35aef0ab7d3833e8466b1062a73e25fb007eaba68c7d68d61f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rio-window/src/platform_impl/linux/wayland/seat/touch/mod.rs:83-91 | rio-window/src/platform_impl/linux/wayland/seat/touch/mod.rs:126-134 \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":"rio-window/src/platform_impl/linux/wayland/seat/touch/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c51392c76b09fd31ff4019d0ca0081080cb039cd81c723954fe1e1c8cd7c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rio-window/src/platform_impl/linux/x11/dnd.rs:76-84 | rio-window/src/platform_impl/linux/x11/dnd.rs:100-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/dnd.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b33e39740e265dd7fbef4b976ed737f58807b3c98aca53e71b287e53514074e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1404-1412 | sugarloaf/src/renderer/vulkan.rs:1158-1166 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99042483c4c9b4d5d5b1f5c8b02d42b3a124f838c75936452d69cf13a073e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:205-213 | sugarloaf/src/renderer/image_cache/cache.rs:638-646 \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":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efcaecee15355589486e542ae65b576b0a8e31d368a3a2a32aceb4f14c0c913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sugarloaf/src/renderer/image_cache/colr_raster.rs:594-602 | sugarloaf/src/renderer/image_cache/colr_raster.rs:618-626 \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":"sugarloaf/src/renderer/image_cache/colr_raster.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52fa59d1f862a4fec3378e73b9c1ca5bc479b90333a369b6306d6dc0f756b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sugarloaf/src/renderer/vulkan.rs:675-683 | sugarloaf/src/renderer/vulkan.rs:701-709 \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":"sugarloaf/src/renderer/vulkan.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8e1955a16fa6735f624c74cccc49370cd68c162989d9bcafb767b08dbc700a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): frontends/rioterm/src/application.rs:1689-1696 | frontends/rioterm/src/application.rs:1720-1727 | frontends/rioterm/src/application.rs:1739-1746 \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":"frontends/rioterm/src/application.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5fc9c6011a5172bf5adeb8fc896dc8a565e26f3f911cc9d3afce21167e8599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): frontends/rioterm/src/bindings/mod.rs:1139-1146 | frontends/rioterm/src/bindings/mod.rs:1221-1228 | frontends/rioterm/src/bindings/mod.rs:1289-1296 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"404295df8b5ad0a54f522fd54cf906c1a15929c447e655e130372aaebc4d5745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): frontends/rioterm/src/bindings/mod.rs:1235-1242 | frontends/rioterm/src/bindings/mod.rs:1303-1310 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadd502dac3070d074c40d6b3ab7b94ffd68b2c9f0c23060126e81061ff853a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): frontends/rioterm/src/screen/mod.rs:2712-2719 | frontends/rioterm/src/screen/mod.rs:2793-2800 \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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e08d38ddec066c1a8a363f3504f6c90cb031cc361324ad14249dbecfc94eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:1863-1869 | rio-vt/src/crosswords/mod.rs:3879-3886 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3850ae57b5d008d272bbc7f4a2f6a374ef110f4dda4815777018be5391835e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:1887-1894 | rio-vt/src/crosswords/mod.rs:1967-1974 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"453187ed89ba87017e33db9d59f66b3f8a5a8060df0fd965ac64de85ba0dd569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:5097-5104 | rio-vt/src/crosswords/mod.rs:5119-5126 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":5097}}}],"partialFingerprints":{"codehealthFindingId/v1":"61906729b7a260ea3d1dc38316de49604633328fb573ea18da6e8db0fc5fc6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rio-window/src/platform_impl/macos/cursor.rs:139-146 | rio-window/src/platform_impl/macos/cursor.rs:147-154 \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":"rio-window/src/platform_impl/macos/cursor.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68268d00ee6af1698925346c7abee13c9054717a1ca780110ab63fe82ca8b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rio-window/src/platform_impl/macos/event.rs:487-494 | rio-window/src/platform_impl/windows/keyboard.rs:1090-1097 \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":"rio-window/src/platform_impl/macos/event.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c77ca74c68edd2bbc229f53371c164ac1b061635fdcb17fc51fb9847bffbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:587-594 | sugarloaf/src/renderer/vulkan.rs:1486-1493 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a34fc3cb331ad4f9b2c0e6aad61f26a2e99af8f4518b8f8289ca9296e434ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:2508-2515 | sugarloaf/src/renderer/mod.rs:2521-2528 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ffa85fbda09e3c3a59c723382d0d51641b9700eb649185df6a3a7263060e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): rio-window/src/platform_impl/windows/window.rs:154-160 | rio-window/src/platform_impl/windows/window.rs:183-189 | rio-window/src/platform_impl/windows/window.rs:348-355 | rio-window/src/platform_impl/windows/window.rs:369-376 | rio-window/src/platform_impl/windows/window.rs:748-755 | rio-window/src/platform_impl/windows/window.rs:935-942 | rio-window/src/platform_impl/windows/window.rs:958-965 | rio-window/src/platform_impl/windows/window.rs:1103-1110 \u2014 all 8 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":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f83fc7ef3c608b9c46e27b7d3e6e0b23bbe5f1f44078fa6b993f6be19529dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rio-vt/src/performer/parser/mod.rs:1152-1158 | rio-vt/src/performer/parser/mod.rs:1184-1190 | rio-vt/src/performer/parser/mod.rs:1213-1219 \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":"rio-vt/src/performer/parser/mod.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"863f6a300c64c263df9e6765f646266e21d64d57a423a17dc23291ed5329f9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): sugarloaf/src/grid/cpu.rs:632-638 | sugarloaf/src/renderer/cpu.rs:796-802 | sugarloaf/src/text.rs:1951-1957 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/cpu.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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":"sugarloaf/src/grid/cpu.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fefe36d8604ec5625afd798311ac5ac847358c6365d16fa232867e3d41f4feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): frontends/rioterm/src/renderer/mod.rs:307-314 | libsugarloaf/src/capi.rs:854-860 \u2014 before extracting anything, compare \u0060frontends/rioterm/src/renderer/mod.rs\u0060 and \u0060libsugarloaf/src/capi.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4a984edb01b5871143b30e107f411f019f23a740d440fa09104d37d4cbc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:1381-1387 | rio-vt/src/crosswords/mod.rs:1440-1446 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c604f2db8160e47aaee1cec3b582d67ea5395d3605fc1d7c28c6f4cbb5a1de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sugarloaf/src/font/loader.rs:575-581 | sugarloaf/src/font/mod.rs:1699-1705 \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":"sugarloaf/src/font/loader.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"63402a2167e5261e49c6f81703ac2e3abd3275c62de71a9442eb25d11ff160af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sugarloaf/src/font/mod.rs:1602-1608 | sugarloaf/src/font/mod.rs:1659-1665 \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":"sugarloaf/src/font/mod.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0061484e1564d3fe2cbe72ec2424668c8735ccd3cfd43e82773c6e642e71cd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1209-1215 | sugarloaf/src/grid/vulkan.rs:1234-1240 \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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c915f24607f0573e518ce0cd4bc7f0786a7d45cb8e8b93a0215c1be6d97d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): sugarloaf/src/text.rs:511-516 | sugarloaf/src/text.rs:577-582 | sugarloaf/src/text.rs:622-627 \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":"sugarloaf/src/text.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d86f93f1ffbcbd83d99ebd48d203b1444066b9f496091ed0e71ccbdcd7f271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): frontends/rioterm/src/application.rs:408-414 | frontends/rioterm/src/application.rs:468-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/application.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c11a930795ad60a041ff337be8b3fe5d6bcc8857e2184c714b375fe8d32375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): frontends/rioterm/src/bindings/mod.rs:1248-1253 | frontends/rioterm/src/bindings/mod.rs:1316-1323 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"41510c58d55107bf1845956af723af17586de3a54efeeb5e8feba355dee7f140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rio-grid/src/lib.rs:756-761 | rio-grid/src/lib.rs:1035-1040 \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":"rio-grid/src/lib.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b634e6abbcc907b2b559cf6de2e4d63f8d1ba7af5111c1325305bbdcb20097f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:5115-5120 | rio-vt/src/crosswords/mod.rs:5221-5226 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":5115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c92a813dc843aa4d5733e41dd6be12b7bbb2781f74ad2860a460f7b3d81e3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rio-window/src/platform_impl/linux/wayland/window/mod.rs:154-159 | rio-window/src/platform_impl/linux/wayland/window/mod.rs:509-514 \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":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeb3411a5aaaf595c9a00066c70eba795de068ec6e70a160ac5ffa33fd99a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sugarloaf/src/sprite/box_drawing.rs:467-472 | sugarloaf/src/sprite/box_drawing.rs:496-501 \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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a53ba6eb0bbf34f9d6d707c0634b48c2a020bfb48eb9751a76d9bebe0da475c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): teletypewriter/src/windows/spsc.rs:72-77 | teletypewriter/src/windows/spsc.rs:134-139 \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":"teletypewriter/src/windows/spsc.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d318afb7aea34bc0f6a0f94cbad55eda0c700a0a8c4ab27fa3d45c1965b703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): frontends/rioterm/src/renderer/assistant.rs:16-20 | frontends/rioterm/src/renderer/command_palette.rs:17-21 | frontends/rioterm/src/renderer/island.rs:1484-1488 | frontends/rioterm/src/renderer/search.rs:16-20 | rio-grid/src/lib.rs:1167-1171 | sugarloaf/src/grid/cpu.rs:520-524 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/assistant.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12546ba335cfd2cf2a3265b61c93146ffc181e79dd4e5d57a8fe29278d2af2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): sugarloaf/src/text.rs:526-530 | sugarloaf/src/text.rs:594-598 | sugarloaf/src/text.rs:639-644 \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":"sugarloaf/src/text.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e99e71246e22bec37262c29618d3c4f9a60ee32a2d6842697ade898a4805241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corcovado/src/sys/unix/uds.rs:177-181 | corcovado/src/sys/unix/uds.rs:212-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/sys/unix/uds.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"780c8bfed49a469690a730c78dffcd418035f6a8a258b7814ced8ef0fb18a039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): frontends/rioterm/src/bindings/mod.rs:1205-1209 | frontends/rioterm/src/bindings/mod.rs:1267-1271 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2f898d76c24f57c002f1df876c3af3c3fe4f9edd9b73a24332a67a1c9012dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): frontends/rioterm/src/bindings/mod.rs:1212-1216 | frontends/rioterm/src/bindings/mod.rs:1280-1284 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f66d8a95628e5e5a1efe7adf541acad67c81768648012f3af6127cf2b8504f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:1208-1212 | frontends/rioterm/src/layout/mod.rs:1214-1218 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"422c1f0e135770cfe00756b0ea9f14d419c20b043aa9bb2f174a4c5fc79f2bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1053-1057 | sugarloaf/src/text.rs:1085-1089 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 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":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199b3175ef5f7253de68e2d6e2f32492fbacb58b015bb55920558db8c6d0ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:1955-1959 | sugarloaf/src/renderer/mod.rs:2113-2117 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"273690ba4c632f9f3569f0f1d837f32aa4ba35c9ba03b277bdb5b8096baa3bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sugarloaf/src/sprite/box_drawing.rs:595-599 | sugarloaf/src/sprite/box_drawing.rs:611-615 \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":"sugarloaf/src/sprite/box_drawing.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"70810918d0b9d6f7cfce493ddc8f2dba5ea83ce28220d133e3795986663d922e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sugarloaf/src/sprite/powerline.rs:63-67 | sugarloaf/src/sprite/powerline.rs:107-113 \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":"sugarloaf/src/sprite/powerline.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe1f1478ab766627b5862cb096afc9f75ea665f066c517e981017fc56ba48f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rio-graphics/src/glyph/glyph_registry.rs:58-62 | rio-vt/src/ansi/glyph_protocol.rs:51-55 \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":"rio-graphics/src/glyph/glyph_registry.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"57216f1193e95dd77bace9e018de9e3a415051beec9ea9c2492d29a16b48e9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:2694-2704 | rio-vt/src/crosswords/search.rs:685-695 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef04ea90abb4fde2cd1f0fac19c21e3b17cf63f7f2a2650a2a859daa37bde61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rio-vt/src/crosswords/mod.rs:2707-2717 | rio-vt/src/crosswords/search.rs:698-708 \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":"rio-vt/src/crosswords/mod.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"749bfe12a21a236c795260eded46622e00d6dd81e848f115f819a11593f33018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rio-window/src/platform/wayland.rs:85-91 | rio-window/src/platform/x11.rs:203-209 \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":"rio-window/src/platform/wayland.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2fc8de180243850eb7557439c94b4ec36721515070e463d714b320ac4e36f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rio-window/src/platform_impl/linux/mod.rs:1012-1016 | rio-window/src/platform_impl/macos/app_delegate.rs:843-847 | rio-window/src/platform_impl/windows/event_loop.rs:658-662 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e651318f6dc6d19c2e1a2d1cb19b5db959f2a362e4a5ed5394bd8a075aa8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rio-window/src/platform_impl/macos/monitor.rs:69-74 | rio-window/src/platform_impl/windows/monitor.rs:31-36 \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":"rio-window/src/platform_impl/macos/monitor.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a5f9c317f1bf9ec1084c6e3abd9ba7662b23c2b6a992d6f437c56f0e75b888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rio-window/src/platform_impl/macos/monitor.rs:80-85 | rio-window/src/platform_impl/windows/monitor.rs:42-47 \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":"rio-window/src/platform_impl/macos/monitor.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a5f0e9eadbfc5acbc6275749db961fdb0ae2100c7e57745fc70214409c685f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rio-window/src/platform_impl/macos/monitor.rs:89-96 | rio-window/src/platform_impl/windows/monitor.rs:51-58 \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":"rio-window/src/platform_impl/macos/monitor.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4871b78b3badad7624aeb0579bdfd6ed5ed0c99973d2bca83deb4d795f0f507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1298-1305 | sugarloaf/src/renderer/vulkan.rs:793-800 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4123cd333e912ae209d5e8f07c0ff5cf9ca0d303b6d1c1b4e6df6501fb31d1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rio-vt/src/ansi/graphics.rs:773-783 | rio-vt/src/ansi/kitty_graphics_protocol.rs:48-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e52ecf9d2db60f544fb542541ba383ee5142b8bb9e25520ee3f1433532818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rio-window/src/platform_impl/web/web_sys/pointer.rs:41-54 | rio-window/src/platform_impl/web/web_sys/pointer.rs:61-74 \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":"rio-window/src/platform_impl/web/web_sys/pointer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa88d3762e271c955f27d75808fd1d42f3b2439500c618c61323160e3baf5e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:2871-2883 | sugarloaf/src/renderer/mod.rs:2992-3003 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4371335f0476a806c2e0f17f1daf68232bf7a79d302c09e49064ab80b64e017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sugarloaf/src/grid/metal.rs:778-789 | sugarloaf/src/text.rs:1302-1310 \u2014 before extracting anything, compare \u0060sugarloaf/src/grid/metal.rs\u0060 and \u0060sugarloaf/src/text.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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":"sugarloaf/src/grid/metal.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb8527af304a31825c4eb52641bccd1cbc1b7df2b8746863644cf3501fe2017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): sugarloaf/src/grid/vulkan.rs:1756-1767 | sugarloaf/src/renderer/vulkan.rs:1121-1131 | sugarloaf/src/renderer/vulkan.rs:1315-1325 | sugarloaf/src/renderer/vulkan.rs:1657-1667 | sugarloaf/src/text.rs:1847-1857 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4466b7ca79bae568792709b3989fa1c5d0141140fc3cc4ea604ab602f5fb08f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sugarloaf/src/renderer/image_cache/cache.rs:130-140 | sugarloaf/src/renderer/image_cache/cache.rs:151-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/image_cache/cache.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6ea9c1597117d9d7566592c826ec83dc28038b02db8e0c87b661d68b9d9acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1449-1459 | sugarloaf/src/renderer/vulkan.rs:946-956 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c2d865795a602ac7e0a838ea189abcdc279ee54bf373e778b9401dbdcce69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rio-window/src/platform_impl/web/event_loop/runner.rs:353-362 | rio-window/src/platform_impl/web/event_loop/runner.rs:377-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/event_loop/runner.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcc6f8862fc133cf22120c18a89ed696cdca8d13886eeca334b422e569aeb7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rio-vt/src/ansi/glyph_protocol.rs:289-295 | rio-vt/src/ansi/glyph_protocol.rs:304-312 \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":"rio-vt/src/ansi/glyph_protocol.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675fd355e77cddb8ea136ae4ef49cbb152b1f9d6e4f9115ebe6d61c94ffd316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rio-window/src/platform_impl/web/event_loop/runner.rs:401-408 | rio-window/src/platform_impl/web/event_loop/runner.rs:419-426 \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":"rio-window/src/platform_impl/web/event_loop/runner.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0f117c0061d4a35df4ac6dbf99da5151f05c2c6eaf99d30c96b425facd53bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:962-968 | sugarloaf/src/renderer/mod.rs:1336-1343 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1de9e9527133a7b1e061731bc66ba2f896fb77167bacc5544c5deaaf8008d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rio-window/src/platform_impl/web/web_sys/canvas.rs:299-305 | rio-window/src/platform_impl/web/web_sys/canvas.rs:323-330 \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":"rio-window/src/platform_impl/web/web_sys/canvas.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6030e91d00443063c12a2e75435644f9b109431314d78dcca334ec9461458c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): teletypewriter/src/unix/mod.rs:975-981 | teletypewriter/src/unix/mod.rs:1004-1010 \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":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"acabf8f10f4f5af35d3b3ead758d8719e153ba3f2e5516ad88b7b8e37e2e5f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rio-window/src/platform_impl/web/web_sys/mod.rs:91-97 | rio-window/src/platform_impl/web/web_sys/mod.rs:112-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"704b3af7bc08e3f67b136812fafbd18f5cb3f758cdc0b859ee79de4c3f3cbe6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sugarloaf/src/renderer/mod.rs:3111-3117 | sugarloaf/src/renderer/mod.rs:3149-3155 \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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba0c76fc2d3e09665b2837dac4926d2b0c0d09464838fcace1bbf24829c1d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sugarloaf/src/grid/vulkan.rs:1770-1775 | sugarloaf/src/renderer/vulkan.rs:807-812 \u2014 \u0060sugarloaf/src/grid/vulkan.rs\u0060 and \u0060sugarloaf/src/renderer/vulkan.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/grid/vulkan.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fbf81df8770affaa20137836a3201675c1c32a95e3a80e937720ef48611739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): frontends/rioterm/src/bindings/mod.rs:793-804 | frontends/rioterm/src/bindings/mod.rs:1051-1062 \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":"frontends/rioterm/src/bindings/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"801014a072391d6ac1be43991b2388cc28b77d7e63a0adb02e31f15da6803079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): frontends/rioterm/src/layout/mod.rs:307-311 | frontends/rioterm/src/layout/mod.rs:472-476 \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":"frontends/rioterm/src/layout/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9439dd5fcf5a9c2e6b5136590215cb0f9e50341fb2db2215c53c0d61e1a3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sugarloaf/src/renderer/cpu.rs:517-521 | sugarloaf/src/renderer/cpu.rs:857-861 \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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1768949881bd865bba43b6f8212908347b9aa23acc64343d204a17a8c9f97b7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rio-fonts: rio-fonts: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d35c5e914fae991506d46bedd3a8f88ddbe738c19217fd1653826874054248c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rio-graphics: rio-graphics: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"108fd797a39914a33d974ee77e6caec399f3a6fb4e1675759ee4d1bc4a16acba"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rio-unicode: rio-unicode: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"805da0f6e5e5e16e107a000fa5aaa2c5e2ecb023934d20fa6a52424a6bd115c2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: corcovado: corcovado: abstractness 0.08, instability 0.00, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd3910f310acc70d74c33c89fed55cd64f913455f498d0e649a38a59add74cda"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rio-window: rio-window: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7ec56f9f773a4d36a7adcc47cfabdb964970eb0480e04ae0d3ef7d0be9b00a6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Poll (LCOM4 4): Poll\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":"corcovado/src/poll.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b278b0c9c17cd0912549fa5f40fc8ad615cb315a46ca7184670ac7513b549b7c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Graphics (LCOM4 4): Graphics\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":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbdec673d940bdeecf205b1780b8f9a7e75bcea8ec8fd6615ab12553daa9212"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontends/rioterm/src/application.rs: frontends/rioterm/src/application.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 168 in Application::window_event at line 1205. 7 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-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- frontends/rioterm/src/application.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":"frontends/rioterm/src/application.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e89618216f5d4314f5ccd708cd51db9b8476a3da235e263aa51e9e6bf9bdfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontends/rioterm/src/screen/mod.rs: frontends/rioterm/src/screen/mod.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in Screen::process_key_bindings at line 1038. 10 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- frontends/rioterm/src/screen/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":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"1739c7086ac5c3f4fd3143531d6d085679bc3f07549d72104097e5bda41ad615"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: librio/src/capi.rs: librio/src/capi.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in librio::capi::rio_surface_key at line 688. 8 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- librio/src/capi.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":"librio/src/capi.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bface3496119a17cfd6c37692a425a844c3ccdba6feec59ad0efc56f6aec76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-grid/src/lib.rs: rio-grid/src/lib.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in rio_grid::build_row_fg at line 1847. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-grid/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":"rio-grid/src/lib.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f7ef0a43f209f16fc04e72abe2c9992c34385d4ebd615dc2e3eddc62b6f9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/performer/handler.rs: rio-vt/src/performer/handler.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in Performer::csi_dispatch at line 1279. 3 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/performer/handler.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":"rio-vt/src/performer/handler.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1048b4dafc223404717391f47aaf5d868432f6f2f43f917e6d863643b10aac77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontends/rioterm/src/renderer/mod.rs: frontends/rioterm/src/renderer/mod.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Renderer::run at line 446. 5 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- frontends/rioterm/src/renderer/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":"frontends/rioterm/src/renderer/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c8f23bed03aa083a98fdc918e81de65974b3a591784e939a3b06fd223354ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/event/mod.rs: rio-vt/src/event/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in RioEvent::fmt at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/event/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":"rio-vt/src/event/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4b1aab18db78857ae5eccdc98b77bdb5e31becdf1d28ab7bf1aa3d92a757cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/crosswords/grid/resize.rs: rio-vt/src/crosswords/grid/resize.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Grid::shrink_columns at line 301. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/crosswords/grid/resize.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":"rio-vt/src/crosswords/grid/resize.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c5f6cb47f66cf4c1d8affb5f113bb2a2542c8b03558c571b366473ce9e75fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/ansi/kitty_graphics_protocol.rs: rio-vt/src/ansi/kitty_graphics_protocol.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in rio_vt::ansi::kitty_graphics_protocol::create_graphic_data at line 1024. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/ansi/kitty_graphics_protocol.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":"rio-vt/src/ansi/kitty_graphics_protocol.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6819ee13bd22ef4e18d7d87f2ad45ee872556eea6e3c022f35412f2528b6d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-backend/src/config/mod.rs: rio-backend/src/config/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Config::overwrite_with_platform_config at line 515. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-backend/src/config/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":"rio-backend/src/config/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8954a66df8d853b5e619cc34e3107eb446032a8898c6d475d7e7d16cb3f4e2fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/ansi/graphics.rs: rio-vt/src/ansi/graphics.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Graphics::evict_images at line 1143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/ansi/graphics.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":"rio-vt/src/ansi/graphics.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"724d4d514f2cff27e507beb7ee57246259850e11031b282497ac3dcf86defe75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sugarloaf/src/renderer/mod.rs: sugarloaf/src/renderer/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Renderer::render_graphic_overlays at line 1195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- sugarloaf/src/renderer/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":"sugarloaf/src/renderer/mod.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f83b1b5138c7fd328cafdb705b799bfd625b43dc9de403c13234d5232adc7cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontends/rioterm/src/router/mod.rs: frontends/rioterm/src/router/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Route::has_key_wait at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- frontends/rioterm/src/router/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":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7cbcb722510837a3f6e3798ae416f6cb71c9da87832ac2a00527920376fb7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: frontends/rioterm/src/renderer/island.rs: frontends/rioterm/src/renderer/island.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Island::render at line 743. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- frontends/rioterm/src/renderer/island.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":"frontends/rioterm/src/renderer/island.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"008655b55216bac49f9eb27ad46cea89f52488278febf309a7aea92aaecae41f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/performer/mod.rs: rio-vt/src/performer/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Machine::run at line 382. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/performer/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":"rio-vt/src/performer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"362d1895f22ee4393edad82c4b62ca1ae5aa5e0c43eeb6d92eb8a12ab56e3d56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/crosswords/formatter.rs: rio-vt/src/crosswords/formatter.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rio_vt::crosswords::formatter::write_sgr at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/crosswords/formatter.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":"rio-vt/src/crosswords/formatter.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b032aabd4abc9a3c9a61f378be7ece33ed72d623948b8a5a990f277039fe3cb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sugarloaf/src/renderer/cpu.rs: sugarloaf/src/renderer/cpu.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in sugarloaf::renderer::cpu::render_cpu at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- sugarloaf/src/renderer/cpu.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":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d148ac15af15e40ff0069d56025eb4b1c4102c14c3f02386ee8c73310a800510"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: teletypewriter/src/unix/mod.rs: teletypewriter/src/unix/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in teletypewriter::unix::create_pty_with_spawn at line 506. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- teletypewriter/src/unix/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":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9190f523154aae29c6dd638200bdaf4cc8ef75aa397ae9b119af2d21ba4e8c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libsugarloaf/src/capi.rs: libsugarloaf/src/capi.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in libsugarloaf::capi::sl_render_surface at line 1113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- libsugarloaf/src/capi.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":"libsugarloaf/src/capi.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4709f0594eb4b3bdfd59e8459befcbc976cd4ce1d198d222ba90e9d7e92aa740"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: librio/src/key.rs: librio/src/key.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in librio::key::kitty_codepoint at line 242. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- librio/src/key.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":"librio/src/key.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3856ec8eed0612ae8611dbacbb09dffb7a1fdafd6274eaa966a8f0a64efebcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rio-vt/src/ansi/mode.rs: rio-vt/src/ansi/mode.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PrivateMode::new at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- rio-vt/src/ansi/mode.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":"rio-vt/src/ansi/mode.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e1b91edf6908aa62bd9a0d9fcfce90b69e62ffaefc54182f36150c7fbae791"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sugarloaf/src/context/webgpu.rs: sugarloaf/src/context/webgpu.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WgpuContext::new at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- sugarloaf/src/context/webgpu.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":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1073a0a7fa0e2e51f055a2cec237f890992a3b531422142132139ae59aae97c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sugarloaf/src/text.rs: sugarloaf/src/text.rs changed 4 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 Text::shape_for at line 269), 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: window.opacity transparency on Windows (#1905)\u201D; \u201Cfix color emoji bitmap rendering (#1843)\u201D; \u201Cfix on linux\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-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 22:13:40 \u002B02:00\u0027 --until=\u00272026-09-17 22:13:40 \u002B02:00\u0027 --full-history --no-merges -- sugarloaf/src/text.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":"sugarloaf/src/text.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d976b978ad473c393b684399f1c9f56db4cebd6f3e29ed8242729e9838eaf28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace \u0022//\u0022 with \u0022///\u0022 and fix TcpListener with Evented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2699924f1c8c33dc9202f49d28ab3c1aebd69bdb3bedec84b48b152d80ec9ddf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get rid of this (windows depends on it for now) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/poll.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"632a665c0ec88705ebd60c42a472f391ee137b3febff938765098dc38b5f839d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Delete this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/io.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a05550c304a4a578812370f3551ffac5ee3aabcc21cda88b5f1b730b3e1df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t drop readiness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/channel.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d077598e6ed78b45c6708d1b61e41a67a558bd0aa462a2aa31e86b162bfbd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this return an error if event is an error. It \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corcovado/src/sys/unix/kqueue.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b729964825a1b0410a62c4b6629a75aa3115f44405ff2f0744c211ee4fbca4"}},{"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":"corcovado/src/sys/windows/selector.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1873046b8d83d5c0e401fb564800fd3bb9123908304a771ff64a4e0b98808b39"}},{"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":"corcovado/src/sys/windows/selector.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0533acc5c116b2a523d0992100e0f8c74642114b04da7d3cdef985b7f279a0f2"}},{"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":"corcovado/src/sys/windows/selector.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8e5894ac883ca7cb9ad6f1d3972650bc57a341a5f2ab732142c954a14b70d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should not use default \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/context/renderable.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"553528770d874e97c040a9f8aa84b3f998bb93369b20d2880a70f56db81db2e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update ime position based on cursor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/router/window.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8326cc352cec73dbddbc6cf974ef1016bad1a277d8d4c754efeb23cb90c04c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use it whenever animated cursor is done \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/router/mod.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"3148fcd22e6dee554d9457030c0a3e4f7747007e2bb09501948987dbf8a3a04e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enable blinking for selection after adding debounce (https://github.com/raphamorim/rio/issues/437)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":4690}}}],"partialFingerprints":{"codehealthFindingId/v1":"be79fdabd6380a5b4ccb394ddc184b93acf9fc4f669a479fb072fdb052c88ce5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO read-out activation token. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/examples/window.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd1b016635488d3fdebcff23fac5e8b57adc661451759e45fe9df8e668c8a91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov): Remove \u0060cfg\u0060 when the clipboard will be added. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/event_loop.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eabf33e37ae66067cc9346921205c6d46308f8cd77aa0b644785b2097a139a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/error.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ab113c34d7bd1c3ce8b0ce1b73dda0cb907bc11f982122986523ad12cd966"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Describe what this value contains for each platform \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform/scancode.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7070e9ff6194e1095a610e215a4daa1589c43b1d8eaf7f1d1d37da5497fb7afb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX only update the error, if it wasn\u0027t handled by any of the hooks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/mod.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3a8f815406f59139fa24699669d6bf92707f90392006b67c9a4f2aafe6fc41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Wire this up without using a static \u0060AtomicBool\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":"rio-window/src/platform_impl/linux/common/xkb/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"798cfaf01b870beb9fa2295d132178c75c9d36f5dbe01ac9c43618d8c00b41e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov) we need to expose it somehow in winit. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/state.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc2a23da0b69c736d4a57400c6f83e65c4920a6716ddadf2d11f36b16efb186"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX can\u0027t remove RefCell out of here, unless we can plumb generics into the \u0060Window\u0060, which \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"416b4697b24a1b12683219f47951115392cfe3e478a1f528830c6ecf57e586f8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX drop after everything else, just to be safe. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"405d08011d6b22d7b68773e0833adc9c4be9c8b20689263f799cbc9a6bcfd76d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove that RefCell once we can pass \u0060\u0026mut\u0060 in \u0060Window::new\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":"rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c123dc1a5115f79c500d3c992c0c51788472ce16f639693e7335197f4fd653dc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: this is just for GNOME not fixing their ordering issue of modifiers. \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":"rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12879a402b58e37c93138811dc36a21a27e32c7bbc95de1a3c266bd39064ca8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: part of the workaround from \u0060WlKeyboardEvent::Enter\u0060. \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":"rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82abff3765bd4d7b7b31fef45cd1cd83690bc264e9f8f0ae0e5fb7b7c8aac28"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX this check is essential, because \u0060leave\u0060 could have a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/seat/text_input/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cd671ded1ccb28365d87e41d7d78b452a6f7028a6c84d3272d38f3b9e01fb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov) handle touch serials. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1bd347c576eb1890a999756e91671f41de06abcc64d1c07921c344e08b7804"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov) handle touch serials. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5d0305c2a9dc769ed7cb5664999b51e21c379c155d65ac788786d1f163ee62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov) handle touch serials. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d551a9c69d11536dad6979a1373bb71228f123721afa970d95321a75af1076"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This won\u0027t fly unless user will have a way to request IME window per seat, since \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/state.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7911fbfbb2b1a92ed7ff076316e6fc641b10cd46794d3bf48a73555fde717e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Do initial commit. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c5cc033f733a20fee443600fff7630e6831a7672d0de337c1d967d089db112"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Wait for the initial configure to arrive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5813eb61e9a5d1fbbef15c369500844429d93b558c059eb7bba90307a6f4511f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX clients don\u0027t know whether they are minimized or not. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"781c0d7d6249d15c8f583f1097a1cda46c2e7dc2398985d86127b0df324b494a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov) v5 of the xdg_shell allows that. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8393f467934ea05328ce932352ee15d1623219570b6038b46578f398058ef734"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kchibisov) v5 of the xdg_shell allows that. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafa73beb04f78afb0fe0ccda486e8a466cae72089847c4dfd9c88f337b9eaec"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX there\u0027s no such concept on Wayland. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/wayland/window/mod.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6429b012afba14f8a30020a8446ffc46f9fb2048be4b0df87ac435b4508ef3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(notgull): I\u0027d like to remove this, but apparently Xlib and Xinput2 are tied together \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/xdisplay.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1079f1707a7dac145c36df2f5bc1ef163fc6ab76aeaf0dad83bd6aff1c527327"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The XSETTINGS window here can change. In the future, listen for DestroyNotify on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/xdisplay.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b218fef897cae9513bad10efbcbdf54915e2c0e73d73f1fb3c7dad071d08c615"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add better message. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/xdisplay.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa79f4b71fb5cd8880b6308a32de09f37cbffd0d59b793398ac60bcf0a9806c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Enable drag and drop (TODO: extend API to make this toggleable) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd3dd3c27771472cfc840f630d029658101ecef132e30f571a35526475ebc09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is actually not correct if we\u0027re setting the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"70614098f615e69c02b51b9b38e71afb312fabf6177244dfe75527b79429b0eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO timer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/window.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ccee82f587ae2dcc85d6fe326747ab70b3e19db2729421e21b170cbda5354f"}},{"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":"rio-window/src/platform_impl/linux/x11/event_processor.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac5b74321c99494e070cdaea7ced429d70940822c5a621c11aa6e9d7ea9819f"}},{"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":"rio-window/src/platform_impl/orbital/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7bde864a0c427921450c5275fe1da0f5f857f377f8c8d44447fd16be6c97bb"}},{"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":"rio-window/src/platform_impl/orbital/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25f398bc5159474f9e7898e4011b150a88f1e641c4686ff545560e483e8e698"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: this struct doesn\u0027t destroy its XIC resource when dropped. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/ime/context.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7540ef3454894da37480219fb01f728498d424ab35bb9b2bffa25c7d2edd2717"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(notgull): It may be worth it to use \u0060unsafe\u0060 to copy directly from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/linux/x11/util/window_property.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"625a4ff0ba8cfa2bd91cf695a40c61edb7c492ff4c3d86c2b01baba85dc60ff5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: center the cursor if the window had mouse grab when it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"044e22547e289f5952933893044a1e03086bf4296d735fe2570d343c5ea83880"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Send \u0060Focused(false)\u0060 right after creating the window delegate, so we won\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"42db72795d4e3d3bd289e1348283e1313bf2923ea71644e04485be2c444989b1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX the resize increments are only used during live resizes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"302ff1643075a9d2ca3dcc5801fa228beccf5b512e42f815b01ba05409d00d48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do this for real https://stackoverflow.com/a/40922095/5435443"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/window_delegate.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4627ae2c69efe5c71851dd1c96036dd1fba038f63f9e636130b0f5210e8a9f34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add an API extension for using \u0060NSTouchBar\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":"rio-window/src/platform_impl/macos/view.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7dee95158435dae338780784b545740dca66f99a0819cd842e9a39d695f93a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Simply use \u0060window\u0060 property on \u0060NSView\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":"rio-window/src/platform_impl/macos/view.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc86de5675abdfba7be934f6c1a53b6bd67118ac9dd98dae5db2d41b31b87a45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Be smarter about this: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/monitor.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"044d19a912c918ee0966ee6a588e0c505ccae5f09862ee522d1526e9c8322bfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Upstream these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/ffi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab480fb9ab95814d3e2cb5623233cca09f6a7a0c7342eb0063834d5971865ee8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(madsmtm): Put this logic in objc2-app-kit itself \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/cursor.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b460be9268bc7dd89a600c037d26b2d5e21d25369dff5fd30b6035d4f91ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle PLists better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/cursor.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b610585a4d9b02d3a71a05cc067526713493fd834dfb55ab42bbb76dbc5ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle PLists better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/cursor.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef83525af44f3324ff88442b6cbce7daec7d3e1c39803f35ab8694ce7dba27b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using \u0060dataWithBytesNoCopy:\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":"rio-window/src/platform_impl/macos/cursor.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"240df7935896357a69f2f3ad477066922a980cf68eb1cd1443fa5f7d6d185b7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using \u0060dataWithBytesNoCopy:\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":"rio-window/src/platform_impl/macos/appkit/cursor.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3834af258113502070a3628716a7384c7f7ef904cf9d512d7c125eed6de3664a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Notify every window that it will be destroyed, like done in iOS? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/app_delegate.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"732d550dc04753088c9f1dc654c2ef25663ea1ceaa8444ef8e069bb6e695dcec"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: how does it make sense that \u0060event_handler.ready()\u0060 can ever return \u0060false\u0060 here if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/app_delegate.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58eaa1850bad1b63cdd95ca634cdc13d6d2ce3428b7463a6efffe6f9c37630d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can this actually accept NULL? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/window.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2877ca03adad2d59536d41c7525c5e5697f955b1436a1e1c221a4630000a06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/text_input_client.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae23d319a9f957251eb7486ad88078f30b27c016a7c4023930584fe334a0e8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Main thread marker! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/screen.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85f691837dd059f077f29a31601a7908b68104f69692d37b5b7b99fd11f2264"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Main thread safety. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/mod.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f07ea6e21abeb2bc03078ba2037e1bb66ad22e02a8b8ed9d71e995aea8f3b3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can this be mutable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/image.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e488ae819b12d913be82de2ee896c68372f4a68ce0d196e29679a90da5ff35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: MainThreadMarker \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/event.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"21902a87d1cc6e96dbf596011d28dce1494fb3da2d533ee928886fbd5767a27d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not sure what these values are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/event.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b777cdd9e211461dbe22a77b489d4cc53f0a432603df0f8465fe5fabc4d2c6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Only allow access from main thread \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/application.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073e819c177f07e0180eb3799390e96f5fdc550afe90ca906b6b9be2ed57dfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: NSApplicationDelegate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/macos/appkit/application.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"51345f06b764b984e526584ffb52d1a90ae417163811d6a4af8f0929dbdecc9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: min/max inner_size \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c04a642a5a2bdd175ba2eb0ea2c3466b8166e40153ad368c14b123e1c6291d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fullscreen \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b19ad54dd55ac8c51d27d269f9d21970a362ecb31772b5485c7eb0409a494d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: window_icon \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf7398c226d364d8b04c7ab319edd1467cf82a2c5d3042f4645fc614ea4d9e2"}},{"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":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5e3c32e5dbea104fd5ecd14191471026e9e50cf71bbd478f7b0b84a4c8333f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: adjust for window decorations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"497104a0400eb7faab88ab2526ff68553211856c63aafe59fb4547470551c78c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: adjust for window decorations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cec73bcb45624b52135579e168d03e1fd7eae80d9d582e35b395728919f15f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: adjust for window decorations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/window.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"324aa6ae9661c0e68d318f3a98fa491ed6cbd098da018572b2ed0ad18f10e2c3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME no way to get real refresh rate for now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3248c309b0ff34fd93e56c4b1c5e0203e3f26e323105d75df6173f93dc4f7fcf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this is not the real refresh rate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"50351720418236606a495496eaac1b6f4dafb5a9198603b88b0719894816b390"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: more control key variants? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc732eae2a5cd56ac8e54a2fb7d5dc66b6e6664f15d54ff5d14ec3e48087525c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Screen, Clipboard, Drop \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"be68eaf67dcb4d6dbaa125e34efbf3adc00a342ea3cf52434030526f7eba2b56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle spurious wakeups (redraw caused wakeup but redraw already handled) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/orbital/event_loop.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7f36db27b1d365a50e494332f1d8cfa3ab504735de91d828656db9d026cc87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: FP, remove when \u003Chttps://github.com/rust-lang/rust-clippy/issues/12377\u003E is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c80efae1d0a0bf26ae2749bea1273fcf173eb7a0b2e2ba6462ddb088635577d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0060u32::div_ceil()\u0060 when we hit Rust v1.73. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/schedule.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"706bef010d067e38def64fa087c3dc045f9eb8c1e3984612d3e17a344090854a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove \u0060-webkit-device-pixel-ratio\u0060. Requires Safari v16. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/resize_scaling.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0989ede236ee3c87f498876f0717f457940d6b17b85512b12fa25ab7a54aa9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: confirm/reproduce this problem, see: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/resize_scaling.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1820bc7aab20ac299b5f7d7f95c805336cd4977b22a7be94ecd86a99163f8a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when Safari supports \u0060devicePixelContentBoxSize\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":"rio-window/src/platform_impl/web/web_sys/resize_scaling.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada383c5473607b1ad9de78127cf85d102c0690fd32ea66a07f977d08a3c66fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace obsolete \u0060addListener()\u0060 with \u0060addEventListener()\u0060 and use \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/media_query_handle.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e1e3dad5c34ec43bc4065b7db9469b9f9792a0931228909911a22276d8631d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this when Firefox supports correct movement values in coalesced events. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/event.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b42cc47e5eacee45341e4f7a6469c4dfa8f814284ec2f4e1c349a66733ff64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when all browsers implement it correctly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/web/web_sys/event.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53ef290f0e5773d72b92e0f2f2ac6a40fe66a59bb28b9dcb25db7c68a53285b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when Safari supports \u0060getCoalescedEvents\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":"rio-window/src/platform_impl/web/web_sys/event.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d50229dbbc451c4c99e52ab68a8b2b2c65e684b2aadc3eeb154e599c271abf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060thread_executor\u0060 here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dcf9e9f2efdbfa15dd6a1cf5c4b6567851b8f5fefa6d55667cf42678d8f78b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060thread_executor\u0060 here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e396a91a3334e763a0bd101c1fe306c1269b7796762e48211a90a693f1b89349"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Write a test once integration framework is ready to ensure that it holds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/window.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3950902cda99754b7aa323a28be0349091a421955e3b36605c1d24ddec934e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate that we can skip on unidentified keys (probably never occurs?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"671d92c5f1b997d0a3cc2695213875dbfe08c88621067781edb5d31b8bb626a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: validate that we can skip on unidentified keys (probably never occurs?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe1cb5d415138906239d3a24e556b138c10ba0d6950097e0fd2c1fa3a16f5a5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060ToUnicodeEx\u0060 seems to fail getting the string for the numpad \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":"rio-window/src/platform_impl/windows/keyboard_layout.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d47a12a61c8a722bf814337b2fce9557399c99af347b3c8699bfb705017680"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Investigate opportunities for caching \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fba8637177c94541eb44b8bc37825127bc87d5a04247db3acafb461fe9089c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: detect WM_DWMCOMPOSITIONCHANGED and call DwmEnableBlurBehindWindow if necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"007da38cf1fdeb189de7498c712dc3e229c7c928da00d8fca7c178919dda9af6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(msiglreith): To add the drop shadow we slightly tweak the non-client area. \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":"rio-window/src/platform_impl/windows/event_loop.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4d0ce8eec310ff27a28775d67d3e9a293ef6b01a292cf5f57fbc91e305156e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! ## TODO: drop the system-binary requirement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/build.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb06910c7381424d6a9b68ca96eb0260a1ff38d8f5c9f35d0b46b248e55a3eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: may need to deal with differences in mip filter. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/components/filters/runtime/samplers.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7665483c6216cbd8c0c15ca26d9ba80dce350f6fdae44b329d9eed0d8b5be47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix formats with signs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6270936e51fd99c1280f44755d787afff692b3900eea228d9edcd17b93243a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: On Nvidia GPUs usage Rgba16Float texture format causes driver to enable HDR. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e00cb57360c82f6f5e70eee74b33906c82038d8e9260a329eee2cb53585c3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use output color format for the CanvasConfiguration when it lands on the wgpu \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/context/webgpu.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ae27319bfdab8f347f2287f4df5bc5a4fc97189eede9a2469c14f85e6140f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently, it will naively just extend fonts from symbol_map \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/mod.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c740b707ebf419ec75bbec7dc55c78753b87c33d4f87965cf2526c21bb11fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should have a new symbol map internally \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/mod.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5dc9bb4231fb21fdfec8faa336b3268ff6ab922f8124bb36cef0b298ede925"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix wasm32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/font/loader.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6080a0872a2a0ec919e910df2084eef8214af8b7dff9bf1c95a3726d7d0b5eea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Underline pattern shaders \u2014 TODO: implement on CPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/src/renderer/cpu.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"db915ba6663fc35aad0fe1181ecb2d9f216d18dd5a3e1ce62b5579c74f59e032"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also copy and check mips \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sugarloaf/tests/util/image.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a021d515146b2c90e5ea6b5a1f53c6dad14e4ab77861df1c452fcc2c6b613c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: https://web.mit.edu/rust-lang_v1.25/arch/amd64_ubuntu1404/share/doc/rust/html/std/io/struct.Chars.html"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/examples/spawn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea22efea04babe1be845ea54032d898ba014fc7b9886921b395f1df25d7d6c91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently we fork the process and don\u0027t wait to know if led to failure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/src/unix/mod.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f365e1ae548ef18072f4c3e1cd39bb09882712ed1874c2fc5bdb80d126a89"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: This will block until the conout pipe is drained. Will cause a deadlock if the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"teletypewriter/src/windows/conpty.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfd4fb6d5ecaa52a8a3aebec94479e9a96d8018007ee4232589e8d2f689bd5b"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate registration logic across types. \u0060Evented\u0060 is a trait/interface that requires implementing \u0060register\u0060, while \u0060Poll\u0060 is the concrete implementation that also exposes \u0060register\u0060. This creates a confusing API surface where users might call \u0060poll.register()\u0060 directly or \u0060evented.register(poll, ...)\u0060 depending on context, with identical signatures.: Remove \u0060register\u0060 from the \u0060Evented\u0060 trait if \u0060Poll\u0060 is the sole owner of the registration state, or ensure \u0060Evented.register\u0060 delegates clearly to \u0060Poll.register\u0060 with distinct naming (e.g., \u0060Evented.bind_to_poll\u0060) to indicate the relationship. (signatures: Evented.register(poll: Poll, token: Token, interest: Ready, opts: PollOpt): Result | Poll.register(handle: E, token: Token, interest: Ready, opts: PollOpt): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6301496f1f9b1822343e05de7700423a045f34a793445f7ea20e22ea8b456108"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate registration update logic. Similar to \u0060register\u0060, both \u0060Evented\u0060 and \u0060Poll\u0060 expose \u0060reregister\u0060 with identical signatures, leading to ambiguity about which method performs the actual I/O or state update.: Consolidate \u0060reregister\u0060 into \u0060Poll\u0060 only, or rename the \u0060Evented\u0060 method to \u0060update_interest\u0060 to distinguish it from the underlying poll mechanism\u0027s update. (signatures: Evented.reregister(poll: Poll, token: Token, interest: Ready, opts: PollOpt): Result | Poll.reregister(handle: E, token: Token, interest: Ready, opts: PollOpt): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ca97dc619cee4e176012b34a9eccf2baac8ab5ef35854f04c1dc54e32fe44f7e"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate deregistration logic. Both types expose \u0060deregister\u0060 with identical intent but different parameter structures (one takes the poll, one takes the handle), causing confusion about ownership and lifecycle management.: Remove \u0060deregister\u0060 from \u0060Evented\u0060 if \u0060Poll\u0060 is the authoritative source for deregistration, or rename to \u0060unbind\u0060. (signatures: Evented.deregister(poll: Poll): Result | Poll.deregister(handle: E): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"824037a667066e38ff52ab5a0a1fa769d797dc4ea3a2da394bbcb7d67ba6d925"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent constructor naming. \u0060new2\u0060 is a non-descriptive name compared to \u0060new\u0060, suggesting a legacy or overloaded constructor without clear semantic distinction in the name.: Rename \u0060new2\u0060 to \u0060new_unregistered\u0060 or \u0060new_lazy\u0060 to indicate it creates a registration without immediate poll binding, or merge logic if possible. (signatures: Registration.new2(): (Registration, SetReadiness) | Registration.new(poll: Poll, token: Token, interest: Ready, opt: PollOpt): (Registration, SetReadiness))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6b7ae9cc5f810ea44964da76ab4dcae5710ced7157452402706d14698e745e60"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous naming for interruptible behavior. While \u0060poll_interruptible\u0060 is descriptive, the existence of two \u0060poll\u0060 variants with different blocking behaviors (one potentially blocking indefinitely or on signal, one explicitly interruptible) can be confusing. However, this is a common pattern in async I/O.: This is acceptable, but ensure documentation clearly distinguishes signal handling. No immediate code change needed, but worth noting for consistency. (signatures: Poll.poll(events: Events, timeout: Duration): Result | Poll.poll_interruptible(events: Events, timeout: Duration): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3d58f9121f319aecc98c0c509fde90cff4605b0730f1e2019c39acc890da5af6"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant methods for creating an empty/none readiness state. \u0060empty()\u0060 and \u0060none()\u0060 do the same thing.: Remove \u0060none()\u0060 and keep \u0060empty()\u0060, or vice versa, to reduce API surface. (signatures: Ready.empty(): Ready | Ready.none(): Ready)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c82a5699861a197d59eb9f356f591852d85bde1036b9bf787867645f81fcbc51"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant query methods. \u0060is_empty()\u0060 and \u0060is_none()\u0060 check the same condition.: Remove \u0060is_none()\u0060 and keep \u0060is_empty()\u0060. (signatures: Ready.is_empty(): bool | Ready.is_none(): bool)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"966a3a931025f19f2fa648d3651dcf7a157923c0f24a9bed523c163e679b020f"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate accessors for the same property. \u0060readiness()\u0060 and \u0060kind()\u0060 both return the \u0060Ready\u0060 state of an event.: Remove \u0060kind()\u0060 and keep \u0060readiness()\u0060 as it is more semantically accurate for I/O events. (signatures: Event.readiness(): Ready | Event.kind(): Ready)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2308699bad9e4ec5fd837323a0c74de5cc443bef4003138bf00720888f4149c9"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent error handling patterns. \u0060load()\u0060 likely panics or returns a default on error, while \u0060try_load()\u0060 returns a \u0060Result\u0060. This is a common pattern but can be confusing if the behavior of \u0060load()\u0060 is not explicitly documented as infallible or panic-on-error.: Ensure \u0060load()\u0060 is clearly documented as infallible or panicking. Consider renaming to \u0060load_or_default\u0060 if it returns a default, or \u0060load_unchecked\u0060 if it panics. (signatures: Config.load(): Self | Config.try_load(): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9d65ae4e878bbc36bbd031df413c0853554457d1ac0ee11137fcd9b63408d63"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate method signatures with different return types or overloads? The list shows two entries for \u0060to_rio_window_colorspace\u0060 with identical signatures but potentially different contexts or return types (one returns \u0060Colorspace\u0060, the other is ambiguous). If they are truly identical, it\u0027s a duplicate.: Remove the duplicate entry. If they differ by return type, ensure the signatures are distinct (e.g., different generic parameters or context). (signatures: Colorspace.to_rio_window_colorspace(): Colorspace | Colorspace.to_rio_window_colorspace())"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e88f943c146db151d45d9d273603e30e29ab862ca82ffb6a3e0baff301cbb5f6"}},{"ruleId":"D26","level":"note","message":{"text":"Split rio-window: This is the largest project and its 27 namespaces are spread across platform implementations (macOS/appkit, Linux/x11/wayland), which is sprawling. Suggested: split into rio-window/platform_impl/* for each OS implementation"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"beaf16762ebd71d8b6387070ec119a3ae3f3457a5b2ec0fb8c0c965560f0ad7c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c508fc8e5b7351a745972517c4e1d7aa6bc5e8bca318f8595dbc85996630260"},"properties":{"commitSha":"76972a0374f42044953504bca192b3eee673c8dd"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b10a4719551e2dd10a3c01b8ff707a351c185570b1d91553fe6ec8fec3b71da3"},"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"}}]},{"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":"fdb89f1d2afc286b06b8b29965f90bb9675b448512519a8ec0570b097832e835"},"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"}}]},{"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":"67fbd652b76b563e2b1d45e535b89cd5c1367b9dad00a90ac78eb592c2242c37"},"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"}}]},{"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":"c4cb5319efa103059108663b5ee65297314aa846361405d866a49e07a9d9ab19"},"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"}}]},{"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":"7bea6529cce9fc367a43ee65fa8ca5f302f180928e0629ccdaf98889530fb172"},"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"}}]},{"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":"2982ce4e2e5af755f648176a0e9ec7f929b1f56a4ce23e1b5800eca28b7b7365"},"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"}}]},{"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":"342096476cd5fe01cc3e959506a1049727f7ea887e7f46a61c6eca5856e5e91c"},"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"}}]},{"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":"85691d5b71949226a7aba8b0ddde30bd5337e3457eef1d0b9a66878fd13fd84d"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c9a0890321ce67a68344fb83f101cb2f46aab09cfc80443474ee402341280603"},"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"}}]},{"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":"fe4588a138c2918b31d684c2084c8d23838de42a3d14c968cf984bf6a7803f17"},"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"}}]},{"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":"84d81be80aebc9da4e506bde8f4c495f9ad9cb4dc9c7319006d91e9621222af2"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e3ad4379ac620f3b12fb0a1a4f35caa09815210b736145144de57b1b1901730a"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"cad8218756f147740cc979bc463b4e7acf882e398944af46c627929463895e88"},"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"}}]},{"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":"437c6e285c0433647d26c0323b1befa33923f6f43bd1c562413225572befa75c"},"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"}}]},{"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":"029c3c7525736c8ca5ea2baa39c9f48fbb974edebbf8f0bfd809c744036a5ce5"},"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"}}]},{"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":"b1b3b3df691d5e0a5347cf062d6341e13f91ae9cb556ea32ee62826bab56f7ff"},"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"}}]},{"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":"8f777902eec8ecbec9e5ae1702bca1577977bda074b4f7f0c7c6c4c26ffcc17a"},"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"}}]},{"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":"03497849d8cbffbc96a9aa06a9083fe55cb1973811d94202e4079780170b673a"},"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"}}]},{"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":"e28424fedc360265a4515c4fa929e6bf297e08d2621025a4f057e7095c665354"},"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"}}]},{"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":"06118e4e2ad4417504a0c9ecb196ad44e0638c81ca30f9db0e68866b6e88fc9c"},"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"}}]},{"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":"023ce9a3afb369c769178e81aa6be35db3c811457503fb4b42077b4bde856c18"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"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"}}]},{"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":"1fb9b9884761137059fbd50172f614860c9fb621267365f75e6cd898d4db5d1e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"55a9feee9774121f2f799f78815f48406c361b20f27615a6b6c4aa576c312700"},"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"}}]},{"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":"86f2130772dcaee755750b649d5b6d962098cc8a941f085f680bdabcb3329507"},"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"}}]},{"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":"3fbadb2d6d12bd90e4b1f4767a80690b96e53a601539986f1e723999186ef13b"},"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"}}]},{"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":"929889218fe2adba5577454da6e2fffb54a21f38de62c057ea511bf22abbc080"},"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"}}]},{"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":"2962376c62b5892b61a03b7ec4e548c0d36141f9868654606bbfab35d3b6165d"},"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"}}]},{"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":"3b05ba515a0129218f03788d09f94768f02609db43e2061d6ce787be3145aa87"},"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"}}]},{"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":"2fe73b602774d18eac6098c34fa8c62a10f9fe29548deaf135b60a011da19d5a"},"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"}}]},{"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":"171f9aa027091bbfbde3977635bf6fb0ded35d854541a26c256ad78517048dec"},"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"}}]},{"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":"00473682ccfeb748544f058bcf6072fd2b379aa040adb7a384a823338b13dfbf"},"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"}}]},{"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":"fb0837bcbac51b9013b252562001cb46485ff2a6f08397f8b0c48a4858070a9a"},"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"}}]},{"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":"f1f0a6790e2b79d7626f56e96569f4ff0e80fbd895d93b032293b4b9cc0b8a9e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"23a71dcb4e02cc9d4a7538e29ad4890d35aa728f975c93e6d8bb041eb2adc327"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ea23ce2c0773652c0086160bab3a2c10ebb0835c3bb72cf1d586c073897eb5a6"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"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":"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":"0897771ffd4e3ceb3419dde32bb5bb1ffcf0f4b413f8009f7ee61b96577e12ed"},"properties":{"dependency":{"package":"smartstring","version":"1.0.1","advisory":"RUSTSEC-2026-0249","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.16.4","advisory":"RUSTSEC-2026-0253","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":"aae99e09135bbef665b5ba07f02694e34b8ec10e4c9bcb4357dee08e79152c65"},"properties":{"dependency":{"package":"bytes","version":"1.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"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":"30ce2d3047c443c35653c29264e403fbd412765ab575293ddbec73b97fac666b"},"properties":{"dependency":{"package":"tracing-subscriber","version":"0.3.18","advisory":"RUSTSEC-2025-0055","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8a70d42fbdc63bec00d2c388af80708bcff35549a646bd04f4552a627cced4f"},"properties":{"dependency":{"package":"adler","version":"1.0.2","advisory":"RUSTSEC-2025-0056","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":"afb4c598068eb206c556551c79fd384467986ae67a8f7ba7c122bbceaf533507"},"properties":{"dependency":{"package":"ttf-parser","version":"0.24.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":"f870cfe7401f52d36701af9f39cce573a8c56a92b694cd8ada58f9265a07fe48"},"properties":{"dependency":{"package":"memmap2","version":"0.9.4","advisory":"RUSTSEC-2026-0186","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f1c0292f5cf923c320cfdd3422abfd186733813cf693ec1ac03ec4e819150ca"},"properties":{"dependency":{"package":"quick-xml","version":"0.34.0","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: sixel.rs \u2194 graphics.rs: \u0060rio-vt/src/ansi/sixel.rs\u0060 (context rio-vt) and \u0060sugarloaf/src/sugarloaf/graphics.rs\u0060 (context sugarloaf) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 7 shared commits counted here, the most recent 3 are \u006037b99d03\u0060 Extract rio-graphics crate and make sugarloaf optional in backend (at that commit the file was still \u0060rio-backend/src/ansi/sixel.rs\u0060); \u00607763f29d\u0060 use transmit_time instead (at that commit the file was still \u0060rio-backend/src/ansi/sixel.rs\u0060); \u006082ffe2b7\u0060 major rewrite on the protocol (at that commit the file was still \u0060rio-backend/src/ansi/sixel.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/ansi/sixel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"844ff5ac05e77968c89636ac0f454cf8be4812e9a3c6a0633a254545056098e6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: application.rs \u2194 app_delegate.rs: \u0060frontends/rioterm/src/application.rs\u0060 (context frontends) and \u0060rio-window/src/platform_impl/macos/app_delegate.rs\u0060 (context rio-window) sit in DIFFERENT parts of the tree yet change together 60% of the time (12 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060d94490d3\u0060 Fix scale desync after sleep/wake and on hidden tabs (#1792); \u00607c65d215\u0060 fix quit flow on macos; \u00605021b2b7\u0060 new quit on macos \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/application.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0779da803dc3ae11135b8cd5024607c9b554e20ae07c5eaf5e6c13cbc15209e8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 sixel.rs: \u0060rio-backend/src/graphics/kitty/mod.rs\u0060 (context rio-backend) and \u0060rio-vt/src/ansi/sixel.rs\u0060 (context rio-vt) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006037b99d03\u0060 Extract rio-graphics crate and make sugarloaf optional in backend (at that commit the file was still \u0060rio-backend/src/ansi/sixel.rs\u0060); \u0060928b147c\u0060 remove copa and rio-proc-macros crate (at that commit the file was still \u0060rio-backend/src/ansi/sixel.rs\u0060); \u00607763f29d\u0060 use transmit_time instead (at that commit the file was still \u0060rio-backend/src/ansi/sixel.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-backend/src/graphics/kitty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77398cacb36fd14d7d243385e77baf570c06e7a23a0a0827800def9e6b5dcdb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 watcher.rs: \u0060frontends/rioterm/src/screen/mod.rs\u0060 and \u0060frontends/rioterm/src/watcher.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 \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 9 shared commits counted here, the most recent 3 are \u0060e566c9cb\u0060 Fix: Configuration updates triggered multiple times on one save; \u0060c22e31bf\u0060 remove use_wa from code reference; \u0060c711e4ca\u0060 remove tokio runtime \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/screen/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8012528c100713108b8188f6b3bf5bdd1f587e36e7b4eefb80e066dd533514"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: vi_mode.rs \u2194 selection.rs: \u0060rio-vt/src/crosswords/vi_mode.rs\u0060 and \u0060rio-vt/src/selection.rs\u0060 change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060071eaaa6\u0060 scrollback-history-limit (closes #993) (at that commit the files were still \u0060rio-backend/src/crosswords/vi_mode.rs\u0060 and \u0060rio-backend/src/selection.rs\u0060); \u006099607e6f\u0060 scale_constraint (at that commit the files were still \u0060rio-backend/src/crosswords/vi_mode.rs\u0060 and \u0060rio-backend/src/selection.rs\u0060); \u0060c22e31bf\u0060 remove use_wa from code reference (at that commit the files were still \u0060rio-backend/src/crosswords/vi_mode.rs\u0060 and \u0060rio-backend/src/selection.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rio-vt/src/crosswords/vi_mode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7d4bdfa3b40f6f7c30fc01ac915f5daba07f6f28b9c53d5516a93f7de8ca0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: font_cache.rs \u2194 mod.rs: \u0060frontends/rioterm/src/renderer/font_cache.rs\u0060 and \u0060frontends/rioterm/src/renderer/mod.rs\u0060 change together 67% of the time (8 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 8 shared commits counted here, the most recent 3 are \u006099607e6f\u0060 scale_constraint; \u00604cdd0343\u0060 constraint width; \u0060754a50ad\u0060 Migrate frontend to new sugarloaf api (#1365) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/font_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea1e3d955a4bf9e20c7ded462a7658d1c950c98789d36177c571ac9a096fae2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: assistant.rs \u2194 welcome.rs: \u0060frontends/rioterm/src/router/routes/assistant.rs\u0060 and \u0060frontends/rioterm/src/router/routes/welcome.rs\u0060 change together 64% of the time (18 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 18 shared commits counted here, the most recent 3 are \u006039a2b22a\u0060 refactor cursor; \u0060754a50ad\u0060 Migrate frontend to new sugarloaf api (#1365); \u00606801f342\u0060 updates \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/router/routes/assistant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7d43c28bf44b79e53d0cda0a33ce4a76bfbe7c2f883165bfcd3b26f7a558ad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: trail_cursor.rs \u2194 mod.rs: \u0060frontends/rioterm/src/renderer/trail_cursor.rs\u0060 and \u0060frontends/rioterm/src/screen/mod.rs\u0060 change together 56% of the time (9 of the 16 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 9 shared commits counted here, the most recent 3 are \u0060a0fb6da4\u0060 trail: converge thin shapes onto drawn cursor geometry, clamp vi row; \u00605432ea88\u0060 Rework cursor trail: exact easing, visibility fade, config surface (#\u2026; \u0060e5d023a2\u0060 allow drag and reorder tabs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"frontends/rioterm/src/renderer/trail_cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea61c8886df0a19a9c49de6497cdd5724a7d59aa4b722a67cdde93e4e8217f"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.96: rust-toolchain.toml declares Rust 1.96 as this project\u0027s toolchain file, and Rust 1.96, superseded by 1.97 on 2026-07-09 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-07-09 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4d8e9b51cd4b2493b326110bfe409c9598039c510d25150fcc40f653a675ac1"}},{"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":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":59,"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."]}]}