{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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":"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF2","name":"Allocation hygiene","shortDescription":{"text":"Allocation hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF2"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"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":"op_ck_bridge.opCkInit (cyclomatic 366): op_ck_bridge.opCkInit has cyclomatic complexity 366 (threshold 15). Of this number, 196 points are the body\u0027s own statements and 170 belong to 42 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebd993b2972b3a7be557892b24bb70d79ad268e4c3815fa902eae87ddc632b4"}},{"ruleId":"D1","level":"warning","message":{"text":"design-capture.collectDesignEvidenceInPage (cyclomatic 184): design-capture.collectDesignEvidenceInPage has cyclomatic complexity 184 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 137 belong to 25 function literals inside it that branch. 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":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"547d011c01a88120c81fdc5bc3fe26fba97fe856fb1348f0af77aa9399640519"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::apply_with_allocator (cyclomatic 177): EditorState::apply_with_allocator has cyclomatic complexity 177 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_apply.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48437274d4572c6a334ffc608cda5a3de5cf5e60cc1026f12128993da267683"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_cursor_move (cyclomatic 148): WidgetHost::apply_cursor_move has cyclomatic complexity 148 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/cursor_input.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"237af1a89f3a4299074881e434bd7a46b0b9b9b3835ce5bcefe9b36bb9e54cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::mcp_serve::registry::rebuild_registry (cyclomatic 143): op_host_services::mcp_serve::registry::rebuild_registry has cyclomatic complexity 143 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/registry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c104415bf56d3f9df7c711e61b9f4e50d5281c18b6b22ffc50cd017d49426fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::handle_key_pressed (cyclomatic 136): DesktopApp::handle_key_pressed has cyclomatic complexity 136 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/keyboard_input.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc4cbbfa9a0dc4d0a607f24c7aa995774770978a1d15f86c99bb7cda6ed1a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ck_bridge.opCkInit (cyclomatic 125): op_ck_bridge.opCkInit has cyclomatic complexity 125 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 76 belong to 22 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ce95afa8bfa757b6de33f4ba3519a1784ddb1de2753dd400ad8d8955dce738"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner (cyclomatic 103): op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c3e141e93d2b01018c642750a6d891d6ef3575dde5ec7a01763a662aecd1d8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::instance::apply_instance_overrides_cached (cyclomatic 102): op_figma::instance::apply_instance_overrides_cached has cyclomatic complexity 102 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc41fa52b76c0e6b34f5aad9311a2931eee7918eb59327206a70aa2b8871db0"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::dispatch_git_panel_press (cyclomatic 99): WidgetHostNative::dispatch_git_panel_press has cyclomatic complexity 99 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/git_press.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ba629a2368ffe40a488b2dfbdc2c3f0df298de9c919f6026f6cee1e49364a4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_dispatch::apply_property_action (cyclomatic 98): op_editor_ui::widgets::property_panel_dispatch::apply_property_action has cyclomatic complexity 98 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_dispatch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac37637314b8a410e626e17b17abd16b84f794f599a1eb105c0fc987025c396b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::canvaskit::mount_keyboard::register_keyboard_listeners (cyclomatic 94): op_host_web::canvaskit::mount_keyboard::register_keyboard_listeners has cyclomatic complexity 94 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/mount_keyboard.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"424c7a52d3d27e9a26da7e48152d1e7e1da0241e6341a12ea52ca004834e55c8"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::paint (cyclomatic 86): WidgetHostNative::paint has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6986ee92a66c822f876450377658c6ddb0534dd40a0b259b69873cba4a36547a"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::on_redraw_requested (cyclomatic 83): DesktopApp::on_redraw_requested has cyclomatic complexity 83 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/redraw.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ce59fee7ece35dfe8b0f3c64d2cf0c089eddc25d715a0617868c52c7b1c774"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit (cyclomatic 70): op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f447a1a58de858866eeae615333d8f858517bbc147c0afecb63f1d992db728e"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::cmd_set_node_layout_prop (cyclomatic 69): EditorState::cmd_set_node_layout_prop has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_layout_prop.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee32e6828bf3da71107d3d342fcd007f8c13facf190c702fd808267eeb3282f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::commit_property_edit_inner (cyclomatic 69): EditorState::commit_property_edit_inner has cyclomatic complexity 69 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"590e36c374d272a3c904c3cee0a917ea4ea85d15bdf62b5deefd2afbc3ae99a5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web.__wbg_get_imports (cyclomatic 69): op_host_web.__wbg_get_imports has cyclomatic complexity 69 (threshold 15). Most of this is not in the body itself: 1 of the 69 points is its own statement and the rest belongs to 60 function literals inside it that branch (lines 69, 89, 95, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b836baf41715c69b850bfedfd5e59ee32e2b6bd7a877a84e73318531a05ab4"}},{"ruleId":"D1","level":"warning","message":{"text":"AIChatPlaceholder::hit_test_with_canonical (cyclomatic 65): AIChatPlaceholder::hit_test_with_canonical has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd1b22e0ca72455143f80bea242cecfd3070cda07afedeab63171498557db0b"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::drain_git_action (cyclomatic 64): DesktopApp::drain_git_action has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/git_host.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6873716a5395b6600df5b3b77ee56d2fa0846fb6892f5b0425bf1f0be585dd65"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_escape (cyclomatic 63): WidgetHostNative::apply_escape has cyclomatic complexity 63 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_escape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575cea5a1aa59a68cc684f450b327c240c4e0ba6cabfdbb028dcbcddbb8683c"}},{"ruleId":"D1","level":"warning","message":{"text":"SubprocessProvider::send_inner (cyclomatic 63): SubprocessProvider::send_inner has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d228df3bb9de148be3b1b5b0e69dd49e7a7c87afa21b59c6a1f133d40fdaee9"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_text (cyclomatic 62): WidgetHostNative::apply_text has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"854eb7c732fe79fd44edf069aa2608596153639c6f7fb4111907be2134de032f"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_backspace (cyclomatic 62): WidgetHostNative::apply_backspace has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_delete.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cedeac28fa69d0086cf6bfa259e7ae551430e1ab17cbe830a1768960fad86af"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::chat_http_server::run_opencode_turn (cyclomatic 58): op_host_services::chat_http_server::run_opencode_turn has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_http_server.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb77c175665d4f3a98af6fd379d35f65118ef0bd38b9e6954e08d3230966c84e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::web_canvas_server::connection::dispatch (cyclomatic 57): op_host_services::web_canvas_server::connection::dispatch has cyclomatic complexity 57 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e94d5d8a4f9836bb8d0bee2b2851ad6dfbd2b37ea745a727c8274fcca792a8"}},{"ruleId":"D1","level":"warning","message":{"text":"GitPanel::hit_test (cyclomatic 56): GitPanel::hit_test 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":"crates/op-editor-ui/src/widgets/git_panel_hit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"76812ccc0f552cc4610bb70e16572d24e5d4b680ac61359a24c12eba34909496"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_send (cyclomatic 56): WidgetHostNative::apply_send 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":"crates/op-host-native/src/widget_host/keyboard_send.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"970fabd299a0e95776d6e853ab2000f057e082cf97ef1f4dca253219e9779372"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_press_inner (cyclomatic 56): WidgetHostNative::apply_press_inner 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":"crates/op-host-native/src/widget_host/press.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"041b6c4b78e3dc9302f31ec2dff1e70a14778e888f34d9957a7e75f88a1a260e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::parser::arguments_field (cyclomatic 55): op_mcp::parser::arguments_field has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0b38e2277441c68059f2a227debe6f2b50d70a7dd4ed62fe0d1195343e1d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_overlay_cursor_move (cyclomatic 53): WidgetHost::apply_overlay_cursor_move 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":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6608931d1e08da92b470bf29cedb7190a4fa533fb13feda6e9e5e220bf354a1b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_cli::command_from_positionals (cyclomatic 52): op_cli::command_from_positionals has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/main.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e68d24c7c8fe173ca6693be88bc5ef6eae105de0806ec9bc0db84aa81b6eed"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyPanel::paint (cyclomatic 52): PropertyPanel::paint has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/paint.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8ff44b0eab2c17a6146bd863851cc1c0ebd5998cbd0cb94a9ecfb01bdd7927"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch (cyclomatic 52): op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abbdd422a5ff7d5d25807ae759298ebeba43066e25818ba6c1c8a2fd7239e86"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::update_agent_settings_hover (cyclomatic 52): WidgetHostNative::update_agent_settings_hover has cyclomatic complexity 52 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/geometry_settings_hover.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ea37cbb9c51ac4870268baaa07f20e0ee9b6598da7e8bfd412894305809c15"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_property_overlay_tiers (cyclomatic 51): WidgetHostNative::cursor_move_property_overlay_tiers has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b06f895e0b901ace54ac5e2da700451a671102cc3d0d890af062778cfd8f99"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::paint_editor (cyclomatic 51): WidgetHost::paint_editor has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/paint.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70ae0a1053c6e12b6f5933cff83481a411ef8e4ccc6d59ff2b3966ef9586f24"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::validation_fixes_apply::apply_validation_fixes (cyclomatic 51): op_orchestrator::validation_fixes_apply::apply_validation_fixes has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b586cdbf47ffa6eb3dd678fa4adcd900393aec7041f38a4a69ba81e8e3b572fc"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::role_defaults::role_defaults (cyclomatic 51): op_orchestrator::role_defaults::role_defaults has cyclomatic complexity 51 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_defaults.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90a57642ae8e609df93bb93b896294ed8d1fcf46846dd50274af08a9bd56552"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ck_image_cache.createWebImageCaches (cyclomatic 51): op_ck_image_cache.createWebImageCaches has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 14 function literals inside it that branch (lines 111, 290, 340, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd7f477d5d963985afa7c3e4687fe84fb8c50597109bd02a1347530b0fe6ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::validation_fixes_apply::collect_node (cyclomatic 50): op_orchestrator::validation_fixes_apply::collect_node has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"58344ddb62e6eff0f08a6e261bb5a2e5f5ebea91069f404d9245a6c818ff8cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"Orchestrator::run (cyclomatic 48): Orchestrator::run has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_orchestrator.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae80c56fd839c0d1563cff447f594c90335181180f2057f695c4d4426ec0c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::chat_click_flow::apply_chat_hit (cyclomatic 47): op_editor_ui::widgets::chat_click_flow::apply_chat_hit has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/chat_click_flow.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bbdac591097c22d48db753a77f1facb364c8ff3007918ed1ac51b40b5de8b2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::cleanup_equalize_siblings::plan_family_repairs (cyclomatic 47): op_orchestrator::cleanup_equalize_siblings::plan_family_repairs has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ead6d2c6f5fa6db706cb74afa5ce1e86db8d011e0a63f674303f10fc004860"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web.__wbg_get_imports (cyclomatic 47): op_host_web.__wbg_get_imports has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 1 of the 47 points is its own statement and the rest belongs to 40 function literals inside it that branch (lines 49, 55, 783, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf8d0d3ff7dfd600d1b3979029fa48f2d988a6889c8c41f44c905c47ff43cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"VariablesPanel::hit_test (cyclomatic 46): VariablesPanel::hit_test has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel/hit.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0265c297f21b72439407ebdc1835c60043f837b615de0fa3a8fe9348ee93aacd"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeError::safe_diagnostic (cyclomatic 45): RuntimeError::safe_diagnostic has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/error.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"321e828cbba46db95088f81955eae3e039787122867938bbc9eb556e44dc7604"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_hint (cyclomatic 45): WidgetHostNative::cursor_hint has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_hint.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5fd57eff5e027af6a3c92c29f27be93d9a128be2224de092e2a7ec897a0b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_late_drag_tiers (cyclomatic 45): WidgetHostNative::cursor_move_late_drag_tiers has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_drags.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6c574d1091d7a3b0cedfd4f0c6e1a3fb640b1c41046c4e08d6eb654b0e52d7"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_release_with_viewport_inner (cyclomatic 45): WidgetHostNative::apply_release_with_viewport_inner has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/release.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e508011f6a7d795b92de162df9bb8b472fe374838b491b0275d83e774019d29d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::canvaskit::mount::mount_ck (cyclomatic 45): op_host_web::canvaskit::mount::mount_ck has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/mount.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daaeee32940d292628da68381441a51c4ce95090095e1958c6e46e5eb63022d"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::update_agent_settings_hover (cyclomatic 43): WidgetHost::update_agent_settings_hover has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/agent_settings_hover.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"042689cd57fcd7f6ba3b93d8187eecd3e5990549deeb437a6950e2c012416d10"}},{"ruleId":"D1","level":"warning","message":{"text":"op_smoke::main (cyclomatic 43): op_smoke::main has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/main.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c60b93a1bb71de140f04f8f5fcef9047534a7d55727b490183160e7d1c3f0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_floating_panel_tiers (cyclomatic 42): WidgetHostNative::cursor_move_floating_panel_tiers has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_panels.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd78234afb25291c1f45082cf8b4f7209af885c06279d27f63ad860769031f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerPanel::paint (cyclomatic 41): LayerPanel::paint has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fdc9363bcd8b73f0f044e3b7d555ca322c6e58b5d691201479de02019c871b"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_wheel_inner (cyclomatic 41): WidgetHostNative::apply_wheel_inner has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/scroll.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bcac66587b9bd1f08d58fca44e7b5ced52f7ec6ac2627876549baa1fd4129a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::mcp_serve::sniff::walk_top_level (cyclomatic 41): op_host_services::mcp_serve::sniff::walk_top_level has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/sniff.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae5d8a31e36e8660baaf912e4d7b190cfbfbdbfa74e0d8e1abb85680d2e403"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_escape (cyclomatic 41): WidgetHost::apply_escape 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":"crates/op-host-web/src/widget_host/keyboard_escape.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32fb6e0473e192418feed149ba4e8f5677617b088f03eaf8d61c983a68678d2"}},{"ruleId":"D1","level":"warning","message":{"text":"CollabPanel::paint (cyclomatic 40): CollabPanel::paint has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"319de4a731f13d4607c8bf13f8ab1ba053764d14a411cb1c7d97dfb8bce3662a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_input_layout::editable_input_rects (cyclomatic 39): op_editor_ui::widgets::property_panel_input_layout::editable_input_rects has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dc3d6236559292d98ffeae24c6be126ed896e6f093d741067a46b52f7cde3b"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::on_left_press (cyclomatic 39): DesktopApp::on_left_press has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f604af24bd609daf0676c6765052cd68740f2819beb97ce02b72389dbdc271"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::handle_menu_action (cyclomatic 39): DesktopApp::handle_menu_action has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/menu_action.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32c08a10bb915510fd281db5f87f37ccebc6a69277a91fda793f5aab1197541"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::persistence::run_action (cyclomatic 39): op_host_desktop::persistence::run_action has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/persistence.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4058faed7e2246312c0401d561926a39c8259f28ab16f7237ac307a9bb03eb00"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::web_canvas_server::handle_web_canvas_request (cyclomatic 39): op_host_services::web_canvas_server::handle_web_canvas_request has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fd7fcfbc40166b028f199f9a6e4a78297f850407e841ba56f619d27f5a3108"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::script_runner::repair_truncated_script (cyclomatic 39): op_mcp::script_runner::repair_truncated_script has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3607e3f8ec3610c1a0c4d992337db58ab2c6b657f535e7317ad1ef962251d8"}},{"ruleId":"D1","level":"warning","message":{"text":"deckkit.audit_document (cyclomatic 39): deckkit.audit_document has cyclomatic complexity 39 (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":"templates/step0/_generators/deckkit.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce49ceffca1635c79e354317c50a00d43d840a47d354056ed3eac0c7bb71307e"}},{"ruleId":"D1","level":"warning","message":{"text":"opCkInit::measureParagraph (cyclomatic 39): opCkInit::measureParagraph has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"62131df1b74f0d27e3dc5a886074e26851c71164e80113ac3de7c1c842011e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasViewport::paint (cyclomatic 38): CanvasViewport::paint has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f614bf2637cd7fcefd0780c36b4761a4f01163d1b7a81aa34335c652e22db20c"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_home (cyclomatic 38): WidgetHostNative::press_home has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/home.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3c96932142d13619b051ccaa6a63427a03d3f0bf888e2349b4e02f04fdcd2e"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_release (cyclomatic 38): WidgetHostNative::apply_release has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/release.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f95a484168781aadaf575dc6f29865d0560b831cd21e0b42f2aa1c0bd3b2df1"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes (cyclomatic 38): op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/prompt_subagent.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba4f6f7d20203a0a84130814e574563a16bd92698a9ba28305fbfee0bb7748c"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot-extractor.vectorizeSvg (cyclomatic 38): snapshot-extractor.vectorizeSvg has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21907f1a3f6cc17650c342004a56ad0c37744b2a7af09f6c5b91ac605fbfc2c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::vectorizeSvg (cyclomatic 38): (anonymous)::vectorizeSvg has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd51370ba5e5ae7db3d5a818229e23ad088055054ed337589d169c805bd1e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript::build_item (cyclomatic 37): op_editor_ui::widgets::ai_chat_transcript::build_item has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf8a46f4007713066290f82ef0402c7088658f5099322917838cedd54fefb28"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_pan_gesture (cyclomatic 37): WidgetHostNative::apply_pan_gesture 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":"crates/op-host-native/src/widget_host/scroll_pan.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"25abf2d495ff6c341bd980ef9b8283a60531e620944a1e061d2aa54431d25f15"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::parser::parse_flat_object_body (cyclomatic 37): op_mcp::parser::parse_flat_object_body 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":"crates/op-mcp/src/parser.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"387388ba1bfa3725f8e61254dd17a30240dfa6d894a5e0b308d10adf9a04fa93"}},{"ruleId":"D1","level":"warning","message":{"text":"op_preview_core::binding_overlay_apply::apply_value (cyclomatic 37): op_preview_core::binding_overlay_apply::apply_value 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":"crates/op-preview-core/src/binding_overlay_apply.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f48d87eb866124cc632378b5c9cbce8adb3523f99f0ece7809ef9c3252f2f9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner (cyclomatic 36): op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/openai.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb46ce48a8f30c0e3f385abd8e9a2af41373c59a251cf7e65930ed0ef217b7c7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker (cyclomatic 36): op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_layout.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cd664912cf1619701e3a09dac3a368bcd8993978354f91f61e0ec0ae12edd2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::selectors::pseudo_matches (cyclomatic 36): op_html::css::selectors::pseudo_matches has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1816c86008c610baa73f5870cecf348d312ae616261402e7f1afcf9303fe9e46"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner (cyclomatic 35): op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae2373c8b8d297113f92032e9cb2e04087f1104fe6f3acf9ba37d967c4fbef"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chrome_extension_core::design_md_validate::is_valid (cyclomatic 35): op_chrome_extension_core::design_md_validate::is_valid has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d608b8761207e071f6dbd6d7935ed5518e28bc94dafdcc06a0985c74b25be628"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::window_event (cyclomatic 35): DesktopApp::window_event has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea4630487a0210fce5f30e2b8c3113e6a6eef74e0edbf2e09288c897b06e99"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard (cyclomatic 34): op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard 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":"crates/op-chat-agent/src/design_agent_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d2c0aeef5175ac7dd94827d5051562f6b6677b8089e9cfa443eacd8f827228"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_host::runtime::network::connection::drive_guest (cyclomatic 34): op_collab_host::runtime::network::connection::drive_guest 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":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"002ff0d350e3bceb8be7a91fc75878897fb86e557ad59c3e5fdb27947ec099e5"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeSurface::hit_test (cyclomatic 34): HomeSurface::hit_test 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":"crates/op-editor-ui/src/widgets/home_surface.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf7e6bc7f193e8d3372996c0f8fa3a6ee33ba4532b88d3fafe7f85a46899722"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_delete (cyclomatic 34): WidgetHostNative::apply_delete 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":"crates/op-host-native/src/widget_host/keyboard_delete.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f644bb57bea26538129af30bb2ec9e0cb03bcd9f6250be0f4c22f5e06708c357"}},{"ruleId":"D1","level":"warning","message":{"text":"opCkInit::drawImageWithOptions (cyclomatic 34): opCkInit::drawImageWithOptions 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":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"319567ac1b113c8c5b9a443f58a678503f39909616fff174990eeac767b43747"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_host::runtime::network::owner::run_inner (cyclomatic 33): op_collab_host::runtime::network::owner::run_inner has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/owner.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"367181c171cace760efe760f3e337ce1b1a3f20907283eea748bb648eee8ac4b"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_ime_commit (cyclomatic 33): WidgetHostNative::apply_ime_commit has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ime.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a8d3273576399a580bb4a5534fb795cd531357972346262702f05c12e3a7d9"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyPanel::hit_test_action_logical (cyclomatic 32): PropertyPanel::hit_test_action_logical has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/hit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"706c87afebccb86894d7f619e71b1762d66524270e745508da5c1144763e8a56"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::resumed (cyclomatic 32): DesktopApp::resumed has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc774e9ba8154d0e3304db208f1c3b2579bf9d2621628397f33114e287867b"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_backspace (cyclomatic 32): WidgetHost::apply_backspace has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b396974166a2c1963a1e8d2251056f7e24f6583ce41870fd53a708ff949d9af"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::parse::resolve_numeric_design_token (cyclomatic 32): op_orchestrator::parse::resolve_numeric_design_token has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/parse.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ca0f93772833c83a5029aaa52ad3f519dce90d40bc83e288b99182b9c5c3bd"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke (cyclomatic 31): op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_image.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa2f72d8ce2b5ba60d5aa2ce9f29b416632d963e24cc9b29c3067cf1ebbc505"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::instance::fingerprint::score (cyclomatic 31): op_figma::instance::fingerprint::score has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/fingerprint.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b63f90a36c084dfa720a2abdfa26f6632d64c4227056d14236c568f8ace81"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::mcp_serve::read_http_request (cyclomatic 31): op_host_services::mcp_serve::read_http_request has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f6da8a28e86e5cc00a0478dd04662fa7846c48e1d072f675bc34fac64b917a"}},{"ruleId":"D1","level":"warning","message":{"text":"design-evidence.sanitizeDesignEvidence (cyclomatic 31): design-evidence.sanitizeDesignEvidence has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 10 of the 31 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 213, 146, 180, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-evidence.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44cd6f1339ceaf79b63adb091ad092ecbcdc62efe9ab18aa44103d3647fc4f5"}},{"ruleId":"D1","level":"warning","message":{"text":"collectDesignEvidenceInPage::walkRules (cyclomatic 31): collectDesignEvidenceInPage::walkRules 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":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"70056758c36bb6c5c8e1ddba07b3a190ee8d2bee5852df63cd1a1bbb685f4e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::active_text_input (cyclomatic 30): EditorState::active_text_input has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_input_focus.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a7421d923c5a08b856114c6daf44e18cf5136f7a96a54a37eede34994803ba"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::variables_resolve::replace::replace_in_node (cyclomatic 30): op_editor_core::variables_resolve::replace::replace_in_node has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/variables_resolve/replace.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba5f69aec25158283bb94df27066fd73387339e3e111faf9456912c7bb6433"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_import::path_data::parse_path_d (cyclomatic 30): op_editor_core::svg_import::path_data::parse_path_d has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe81338bf42386ee342b3f7737e00a257e54e81fd5f4789b57ca827c8d82bb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::style_guide_context::infer_tags_from_prompt (cyclomatic 30): op_orchestrator::style_guide_context::infer_tags_from_prompt has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/style_guide_context.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce06941a8cf29962be94bbff5446612dd439a2fb7b9791054a23d15a82b84ce7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::enforce_slide_padding_floor (cyclomatic 30): op_orchestrator::cleanup_slide_padding::enforce_slide_padding_floor has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef80cde1f20753d8b294284c05cb1483f95c4517f97fb380f5935962467dc60"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_host::runtime::network::connection::drive_owner_peer (cyclomatic 29): op_collab_host::runtime::network::connection::drive_owner_peer has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8b92e8d65b88738423e42ba2a8164fe8b01cb432a8f8eaba04555e18246e53"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::layer_context_flow::apply_layer_context_ids (cyclomatic 29): op_editor_ui::widgets::layer_context_flow::apply_layer_context_ids has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_context_flow.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1b65d383c2d6c13bbf7d79cf8d2ca232dc5de8163085167dbab97c93c4af0"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_form::paint_field (cyclomatic 29): op_editor_ui::widgets::agent_settings_builtin_form::paint_field 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":"crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92b1ffba0ade4d220a64a64567a599edb1b1f0d87f7440404c4a487cb0cb5df"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::home_surface_paint_panels::paint_composer (cyclomatic 29): op_editor_ui::widgets::home_surface_paint_panels::paint_composer has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb47f2b8bc9a3c5e6a49a966f93945c10381fe01e8f4218b86467c1f11ef337"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::design_session::apply_progress (cyclomatic 29): op_host_desktop::design_session::apply_progress has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa416188bb579a6d78d4d92f54d4208a5832e2d181682a40fd3cd6ca25416b73"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_modal_tiers (cyclomatic 29): WidgetHostNative::cursor_move_modal_tiers has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_modals.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"73681c7b4b71d7e1afc6f11faf9f767e08eeec98008b786fb0b3904cddcab337"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::geometry_diagnostics_collect::collect_diagnostics_with_context (cyclomatic 29): op_orchestrator::geometry_diagnostics_collect::collect_diagnostics_with_context has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_diagnostics_collect.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"95309cab9bb551333bbb032ff9d91cb8ad4a54241ba7e6a35e35967162467288"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::loop_finalize_record::record_same_id_shallow_patches (cyclomatic 29): op_orchestrator::loop_finalize_record::record_same_id_shallow_patches has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize_record.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8527944f7dc282af85e7b2a69a0ffd14b2edecbfd3932f2ed2eaf3b501dd9347"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::role_post_pass::contrast::fix_button_foreground_contrast (cyclomatic 29): op_orchestrator::role_post_pass::contrast::fix_button_foreground_contrast has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/contrast.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0483f76cefd182d3ef6a2cec3edbfb2b54df2f681d94f9f699ebea8f91d66c39"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge.parseInboundFromPage (cyclomatic 29): bridge.parseInboundFromPage has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/src/protocol/bridge.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e9b85ef7f2f2993c4506eabefb4eec3cdac3b30275c85e5e12e4af0b5d75d1"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::variables_resolve::resolve_node_for_canvas (cyclomatic 28): op_editor_core::variables_resolve::resolve_node_for_canvas has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/variables_resolve.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2465205b3f3cd25ad176881a2af0a101c13f4ab4b9617a9bce0f1c6981ebc3a"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceSurface::hit_test_layout (cyclomatic 28): WorkspaceSurface::hit_test_layout has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/workspace_surface.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b2e8b2165b39f0871cfe169023c594212fb14a9a010a4a9eecea277ce2b7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit (cyclomatic 28): op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3c6c15808389b65a5d7dcadd55376b89b57f2f57d122fb0ce60ccbed76c3cb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::instance::apply::apply_to_node (cyclomatic 28): op_figma::instance::apply::apply_to_node has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/apply.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1ccbbe0ed6759dada6943883a99af899fc0c0fd46494d75972e949f44c86e2"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_menu_modal_tiers (cyclomatic 28): WidgetHostNative::press_menu_modal_tiers has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec229dd2a3a129f6b35122289df62f01750872acae5972d4c6fc4c51c1181b04"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::mapper_margin::finish_children (cyclomatic 28): op_html::mapper_margin::finish_children has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_margin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e72ee72b67c4a778668f1886b484bce2db11ed12b708c18c9eb53dd7941256"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::subtask_completeness::expected_item_count (cyclomatic 28): op_orchestrator::subtask_completeness::expected_item_count has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/subtask_completeness.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c8509bab4ab2b12dc9aec7d5132d79993f31a5749093c9fe0c34f703e2cde4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_path_data::absolute_segments (cyclomatic 27): op_editor_core::svg_path_data::absolute_segments has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0aec765480c7f87a11c2c9f7f268fece3114df002cdc4d7914c19ecf644a4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_commit::commit_property_focus (cyclomatic 27): op_editor_ui::widgets::property_panel_commit::commit_property_focus 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: op_editor_ui::widgets::property_panel_commit::property_focus_initial (cyclomatic 41) 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":"crates/op-editor-ui/src/widgets/property_panel_commit.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"42617c0e9f166b5d421b70ee935f7847e41fe9a0b8ad35677b7c93a2f62746be"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::scene_template_press_flow::press_scene_template_center (cyclomatic 27): op_editor_ui::widgets::scene_template_press_flow::press_scene_template_center has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_press_flow.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc50be8f29840432188e1d003f3fdf7e13dc47e15269cef0ce611fd833f2b6"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_mobile_more_sheet_tier (cyclomatic 27): WidgetHostNative::press_mobile_more_sheet_tier has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"5249b0f9d5e378b69f8e2608df83e7e825e17ffbcaca2927dd520220fb351b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_text (cyclomatic 27): WidgetHost::apply_text has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"085dd7622c5b96c7505aff51208096bd43c9eda89d8d20fa58fdb87fedc22591"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::cleanup_section_margins::unify_transparent_section_margins (cyclomatic 27): op_orchestrator::cleanup_section_margins::unify_transparent_section_margins has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_section_margins.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"058dacd7cfd134d0f2360f3bd46926e1c6ea2829fc085eb361c41792353931a5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_pen_loader::adapter::node_payload::node_to_payload_with_text_context (cyclomatic 27): op_pen_loader::adapter::node_payload::node_to_payload_with_text_context has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/adapter/node_payload.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0e461eee124d63b430f4aa32fa48aa1256e1d54c1ffcdf4168e7eefbfff387"}},{"ruleId":"D1","level":"warning","message":{"text":"op_auth_bridge::collab_union_policy::canonicalize (cyclomatic 26): op_auth_bridge::collab_union_policy::canonicalize has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/collab_union_policy.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"041923768ab5bd2d4e4c6546b46325818a963684dba5f239f2e0f3125aaf069c"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::active_text_input_mut (cyclomatic 26): EditorState::active_text_input_mut has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_input_focus.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"10112d6471c3b88cec167acf88e690ba80e393a1891efdcdd759b57f73e30a32"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::host_settings_commit::commit_settings_focus (cyclomatic 26): op_editor_core::host_settings_commit::commit_settings_focus has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_settings_commit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e79233ccc1a5c1f1fc34fcbb65be760e83f1df9b094428696180223addec10d"}},{"ruleId":"D1","level":"warning","message":{"text":"AIChatPlaceholder::paint (cyclomatic 26): AIChatPlaceholder::paint has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2b6634da5ebec84dfefed0f208e02eb209fcb816a7df91414619037f85d771"}},{"ruleId":"D1","level":"warning","message":{"text":"GitPanel::paint (cyclomatic 26): GitPanel::paint has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel/paint.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6524734396f1f035f26f8baa6d225455d5e258d4d7c48c0c6b6f1c7991e6e93"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_property_overlay_tiers (cyclomatic 26): WidgetHostNative::press_property_overlay_tiers has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_property_tiers.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d0ff5c0218e8fdff5fa46fbe4bb0132dca175c1fdf82b57c4f132c2dd1793b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::export_pptx::unexpressible (cyclomatic 26): op_host_services::export_pptx::unexpressible has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_pptx.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ede7332e5c8edb63b6be7723edf373d3ff5dc6c327c3d62bbc4aaaa5bee0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::declarations::expand_background (cyclomatic 26): op_html::css::declarations::expand_background has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: op_html::css::declarations::expand_declaration (cyclomatic 35) 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":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"596d9d34ae7ae2204801f891d97b9c35bd4ec139b48a54f7acbb1ef29a02b39e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::batch_layered_guidelines::generate_section_guidelines (cyclomatic 26): op_mcp::batch_layered_guidelines::generate_section_guidelines has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_layered_guidelines.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b19c9a5ff22496a257c6db67a8e4b1b5ffb5952fe14f8755dba58655612d0e5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_opmerge::merge_core (cyclomatic 26): op_opmerge::merge_core has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-opmerge/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78da2bcff93680bc1c4b4812797fe83eeca8c763f9a662e7789046501db1f4d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes (cyclomatic 26): op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2293b6f54ba76e091c5a242d1808102c137e9ba347fbcdbdf3bbd31e606e340"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::compact_prompt::build_compact_planning_prompt (cyclomatic 26): op_orchestrator::compact_prompt::build_compact_planning_prompt has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/compact_prompt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaa107a8be2047c5c4542185773637ad84c08c813d19f2868dec24431fd5947"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_relay_server::connection::relay_paired (cyclomatic 25): op_collab_relay_server::connection::relay_paired 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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a57caefa1011879efb2a0c1606e258f9d429026e632aa62dfae8fc4940d225f"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserState::handle_action (cyclomatic 25): BrowserState::handle_action 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":"crates/op-collab-transport/src/discovery_bonjour_browser.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb17516232599ff1c4cd323ed008bf1302480cb8b8a08424c0aecbb12967b44e"}},{"ruleId":"D1","level":"warning","message":{"text":"CollabPanel::hit_test (cyclomatic 25): CollabPanel::hit_test 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":"crates/op-editor-ui/src/widgets/collab_panel_interaction.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702166f9034c09ca6f892f545b00c44447e946c92d4466dfe9edaf9ebe5fa25"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout (cyclomatic 25): op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout 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":"crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d99fa3a3ff3a755eeb23d9fc7f2197c4a6e633ca4f1a421293e55e1c577670"}},{"ruleId":"D1","level":"warning","message":{"text":"op_engine_ffi::desc::parse_create (cyclomatic 25): op_engine_ffi::desc::parse_create has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/desc.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a0b3bb0c970cccd98f0da4fe13321811411192f14a07c43251fafcf17fe256"}},{"ruleId":"D1","level":"warning","message":{"text":"op_engine_napi::action::printable_char (cyclomatic 25): op_engine_napi::action::printable_char has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-napi/src/action.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cd7445f5834444e9ff71580ae9ab19ff1616fd9bf638993c0f1a62ca09b50a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::boolean_fallback::apply_result_paint_to_artwork (cyclomatic 25): op_figma::boolean_fallback::apply_result_paint_to_artwork has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/boolean_fallback.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe530a0c3f8f7f9a27632c1fcbca9bd6acc0f8c56c8fb2441efc35afeb0844e"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_ime_preedit (cyclomatic 25): WidgetHostNative::apply_ime_preedit 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":"crates/op-host-native/src/widget_host/ime.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ca8aa7c60a41e73165f06a48726e2d334342ef5fcc60a0cba8073591f0103"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_delete (cyclomatic 25): WidgetHost::apply_delete 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":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"93869eab574ae710759685f3d614f1bae1a5159faae260e970a78e95e58b0f19"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::update_dropdown_hover (cyclomatic 25): WidgetHost::update_dropdown_hover 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":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9f690a6941307bb0dfe460239cea2445f895367c48596aa6c6bfc8c0c4b09d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::script_runner::escape_raw_newlines_in_quoted_strings (cyclomatic 25): op_mcp::script_runner::escape_raw_newlines_in_quoted_strings 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":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26c805b9aa882d884c0e00331163965f3d101f2573354ad95616504706165d4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::repair_record::describe_command (cyclomatic 25): op_orchestrator::repair_record::describe_command has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/repair_record.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17bce55698723f99fb58a24db351aef1cfa16e66b713ed7260d076b57be752d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::validation_dump::walk_dump (cyclomatic 25): op_orchestrator::validation_dump::walk_dump has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_dump.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a73a8d90e25d13f48de0a552d7b1325bfb53746de83287ff1863137394a3c6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::radial_repair::radial_stack_repair (cyclomatic 25): op_orchestrator::radial_repair::radial_stack_repair has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/radial_repair.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"112baf9bef8fa745a55019dd7ae5b5f62c0f6412c9961764bdd811befc732a8e"}},{"ruleId":"D1","level":"warning","message":{"text":"freshcheck.audit (cyclomatic 25): freshcheck.audit 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":"templates/step0/_generators/qa/freshcheck.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b9857587825875606749922f5e3942bd40d203569ce64333079e35f4bd027b"}},{"ruleId":"D1","level":"warning","message":{"text":"CollabRuntime::route_guest_output_inner (cyclomatic 24): CollabRuntime::route_guest_output_inner has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/effects.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"40df763792168ecbfe3745e3488cef27f7f1d1466751b5c2670aa70671793404"}},{"ruleId":"D1","level":"warning","message":{"text":"SceneTemplatePanel::hit_test (cyclomatic 24): SceneTemplatePanel::hit_test 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":"crates/op-editor-ui/src/widgets/scene_template_hit.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8aa8e08aa5f98b7af24dde58ae59ca085642d00745a3cda708d27f8b3f7054"}},{"ruleId":"D1","level":"warning","message":{"text":"TopBar::button_rect_with_measure (cyclomatic 24): TopBar::button_rect_with_measure 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":"crates/op-editor-ui/src/widgets/top_bar_geometry.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"353212e15bb284533ae77a88023754131196d078ee2134c516c45d53282ab374"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_layer_bounds::subtree_visual_bounds (cyclomatic 24): op_editor_ui::widgets::canvas_viewport_layer_bounds::subtree_visual_bounds 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":"crates/op-editor-ui/src/widgets/canvas_viewport_layer_bounds.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e7f00f314d953c2252d92d9bfe1ed53be6dd3894552e6246998096c622316d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_text::paint_text_node (cyclomatic 24): op_editor_ui::widgets::canvas_viewport_text::paint_text_node 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":"crates/op-editor-ui/src/widgets/canvas_viewport_text.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecb2d30709a9898d3f1367b429d11d057bcebaf73bb1dfe9be81f2381b61b32"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::svg_export::emit_node (cyclomatic 24): op_editor_ui::svg_export::emit_node has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/svg_export.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eb56fffb0d021732501958ce88d9f200b10dab649cac3999b73b634dca4078"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth (cyclomatic 24): op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth 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":"crates/op-editor-ui/src/widgets/collab_ui.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3227fc5a96488e2c13523dd637122b5328631dd6287898b981639757fce9ab"}},{"ruleId":"D1","level":"warning","message":{"text":"op_engine_ffi::op_pointer (cyclomatic 24): op_engine_ffi::op_pointer 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":"crates/op-engine-ffi/src/lib.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"403b67c053f082e417301a03a2b4b44a5459c62d3a6e32da53e54873b40308e5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::mcp_integrations_dsh::update_dsh_patch_config (cyclomatic 24): op_host_desktop::mcp_integrations_dsh::update_dsh_patch_config 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":"crates/op-host-desktop/src/mcp_integrations_dsh.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6ade126eddb617a4a9686e8e88cf74942c7d6ab6796413a9c98661442bec50"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_status_align_picker_tiers (cyclomatic 24): WidgetHostNative::cursor_move_status_align_picker_tiers 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":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32e5fce8678fba3d375d4cc56fa02a0106ac94f7e926a83218e54ad6926cdb6"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::focused_input_selected_text (cyclomatic 24): WidgetHost::focused_input_selected_text has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_text_inputs.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef39b9c5403361e0118003027868f1244506746555e22257bcd4d87dd02d622"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_release_with_viewport (cyclomatic 24): WidgetHost::apply_release_with_viewport has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/release_input.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"05777a99dd1accdf241e5de5f9568741bd111175983b69ed7cc98bf9883c61ba"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::project_zip_range::parse_html_zip_central_directory (cyclomatic 24): op_html::project_zip_range::parse_html_zip_central_directory 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":"crates/op-html/src/project_zip_range.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6694a2682ee8357971498c6299612d3414647c18b7db1d16fe41c548ce671e44"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::geometry_row_fixes::collect_row_overfull_fixes_with_context (cyclomatic 24): op_orchestrator::geometry_row_fixes::collect_row_overfull_fixes_with_context 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":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4242a2ad6d196ff6423972f1dc4546ed81829234d47ed3999fd2089aa886f980"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::spacing_repair::strip_in_value (cyclomatic 24): op_orchestrator::spacing_repair::strip_in_value 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":"crates/op-orchestrator/src/spacing_repair.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09b66a3a0b9ca569a9694e22d6116987ae47d89b62d56a11b27a94ef8b04a51"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::role_post_pass::micro_surface_radius::round_missing_semantic_micro_surfaces (cyclomatic 24): op_orchestrator::role_post_pass::micro_surface_radius::round_missing_semantic_micro_surfaces 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":"crates/op-orchestrator/src/role_post_pass/micro_surface_radius.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabd1bf5e7887eaf8137cd00dc0eb3d9dc81fba91a36a8481d275c4385a3cc8b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::mobile_reflow::candidate_for_root (cyclomatic 24): op_orchestrator::mobile_reflow::candidate_for_root has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_reflow.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ebb5b365922170682c131a74987d47129d4623fbeae4faf2bab23134dcb0c9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::mobile_content_rail::collect_repairs (cyclomatic 24): op_orchestrator::mobile_content_rail::collect_repairs 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":"crates/op-orchestrator/src/mobile_content_rail.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5755e6e22ac1ec551c4e42c52c07172904ae77a20b09b3aa6bfa477ff4c9724e"}},{"ruleId":"D1","level":"warning","message":{"text":"generateDesignMd (cyclomatic 24): generateDesignMd has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal 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":"packages/op-chrome-extension/client.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d2056ad8ebe25fdcb041736f4e6e2d2abc812e8740dd356aa40486c48263db"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab::ticket_json::decode_ticket_string (cyclomatic 23): op_collab::ticket_json::decode_ticket_string has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/ticket_json.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b01f3b8d7eb78ef52a0294523789cf76bfdf4eeb4440d04221113682337e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_relay_server::connection::serve_connection (cyclomatic 23): op_collab_relay_server::connection::serve_connection 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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"db212dc0012b8de18302afc44c2bca928cca89ab559b5b4c123ba4d06cceffc7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_design_lint::plan::detect_and_plan (cyclomatic 23): op_design_lint::plan::detect_and_plan 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":"crates/op-design-lint/src/plan.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad702c9c9db54f54b7c44b692e19546819a4d442ede4e9ec058a68c3ae8847c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_host_core::settings_io::apply_payload_with_options (cyclomatic 23): op_editor_host_core::settings_io::apply_payload_with_options has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/settings_io.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce580752be8cd672673782251b1cc5b40aa4388ac5026519cef07897b2a7e7ea"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_host_core::codegen_session::run_pipeline_with_model_and_cancel_token (cyclomatic 23): op_editor_host_core::codegen_session::run_pipeline_with_model_and_cancel_token has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/codegen_session.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05a5bde9466e6013c177723e8db8f9dd1b088d41cbe34f5ce7d1f6b888e3d73"}},{"ruleId":"D1","level":"warning","message":{"text":"TopBar::hit_test_with_git_rect (cyclomatic 23): TopBar::hit_test_with_git_rect has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1029e2a882bf58a2af4338c983b88d64a57c9bd5bcdd94cbfc123a921fcfa0e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TopBar::paint_chrome (cyclomatic 23): TopBar::paint_chrome has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_paint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"687e7c8fd8d7b10b0798314834dd6d1ccbbaa13b58726ff27036cd5e07af6d28"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::node_mapper::style_references::resolve_on_node (cyclomatic 23): op_figma::node_mapper::style_references::resolve_on_node has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/node_mapper/style_references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"605db5ef8daeb2e0d9a6d17e2eaf2f787a6e6decf331a9effaa417c5492c95d4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::vector_decoder::scale_command_path (cyclomatic 23): op_figma::vector_decoder::scale_command_path has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"268b7b308a4f8cf747f373a8e32ef58380797897e35f9c68160ed141622162e3"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_node_drag_cursor_move (cyclomatic 23): WidgetHostNative::apply_node_drag_cursor_move has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b5cc80b42fd52be6328f0c5c6b9ecac9eb1be6a71778ebdf338d66458f7a24"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::dispatch_file_menu_press (cyclomatic 23): WidgetHostNative::dispatch_file_menu_press 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":"crates/op-host-native/src/widget_host/property_input_dispatch.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5b1c8cd7753be92aa41257b12415c3ea5bd28cb822ffc8334fb614fd47accd"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::mcp_live::connection::serve_connection (cyclomatic 23): op_host_services::mcp_live::connection::serve_connection has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_live/connection.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"68db6b9d07df33b05165fb922a22e7aa4c35cb2db6503b0af221b2dddd686259"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::transform::function_matrix (cyclomatic 23): op_html::transform::function_matrix 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":"crates/op-html/src/transform.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1074402b21278f4390999c39068b61754131d3f6adc0989d5449266423848ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::batch_design_wire::parse_item (cyclomatic 23): op_mcp::batch_design_wire::parse_item has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_wire.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19938714d36a9a371bbb16fdde5a4a353302a4197b563c269861ff0ab4bccb5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes (cyclomatic 23): op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/subagent.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e063eb3897b8fcbd6f7d1402685b492904e481e8f1604fea3e57ea4a972c8afa"}},{"ruleId":"D1","level":"warning","message":{"text":"op_pen_loader::payload::legacy_normalize::normalize_node_value (cyclomatic 23): op_pen_loader::payload::legacy_normalize::normalize_node_value has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/payload/legacy_normalize.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2d6a04e5260788aa154425634cfd88fd1c3097bc601d42c652d15baf7ebd93"}},{"ruleId":"D1","level":"warning","message":{"text":"OpSurfaceViewEditorTouch.editorTouch (cyclomatic 23): OpSurfaceViewEditorTouch.editorTouch 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceViewEditorTouch.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c4a126c4a418d4d63eb0fcd2252049bf0b9901f94ff506488208c0294d1850"}},{"ruleId":"D1","level":"warning","message":{"text":"OpSurfaceViewShellBridge.pollShellAction (cyclomatic 23): OpSurfaceViewShellBridge.pollShellAction 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceViewShellBridge.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42a6dd288aa0ffee6ba95bd52182435a45e3dfb20bd05a7c48f3caacb258654"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ck_image_cache.jpegFitsThumbnailBounds (cyclomatic 23): op_ck_image_cache.jpegFitsThumbnailBounds has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5800d724430e4a080bcdfad71e24b9e430b97fb9ef7f363607b6a83e73b2939"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_import::style::parse_svg_color (cyclomatic 22): op_editor_core::svg_import::style::parse_svg_color has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/style.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeb1fbb1ae3324155be6f34436a945750e4bb0be3e8b28f166ffda89e36e032"}},{"ruleId":"D1","level":"warning","message":{"text":"CollabPanel::hover_at (cyclomatic 22): CollabPanel::hover_at has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel_interaction.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15356aa4adcf8f036ee2af8116d5cc868e550f0fae30c99267fa4b2fa76421a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_hit::transcript_hit (cyclomatic 22): op_editor_ui::widgets::ai_chat_transcript_hit::transcript_hit has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_hit.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"273a7b24675b46f790162ef3990837c18c0e6c98a6537498cc6f49043276f773"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::home_surface_layout::layout_for_scrolled (cyclomatic 22): op_editor_ui::widgets::home_surface_layout::layout_for_scrolled has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_layout.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb69c785f856f6858dde4c5994bf9aa6634e0575b85d56df8060438aec0fe7fb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::home_surface_copy::task_copy (cyclomatic 22): op_editor_ui::widgets::home_surface_copy::task_copy has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_copy.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c17dff16e0a08f4fa9e29a915132bc50c4d91daaa453b801dcf84df967a6ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density (cyclomatic 22): op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ae4e3bf6a8043145c01a093ee67562cd617c1ce3211f3f34693d3cb7dd2bac"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript::paint_transcript_with_selection (cyclomatic 22): op_editor_ui::widgets::ai_chat_transcript::paint_transcript_with_selection has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03b28e37d8f67f7ad04166b8c3812a2697647d4afdf94e2131626b6c42afe86"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopApp::on_cursor_moved (cyclomatic 22): DesktopApp::on_cursor_moved has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ae01fc71da31023700a58e2a40398d0da3385bf4f8141b18564f51f9ae4bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::chat_acp::run_acp_turn (cyclomatic 22): op_host_desktop::chat_acp::run_acp_turn has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_acp.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be578fa24b6862bcd20a88cd6074c6439a0b3976e5a5f94736cb4c362412ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_topmost_overlay_tiers (cyclomatic 22): WidgetHostNative::press_topmost_overlay_tiers has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"03888fca005afe6735d615a46d8bdee6b5d6a1cea49f20ba152b70aa512ba44a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::cli_model_discovery_antigravity::parse_antigravity_models (cyclomatic 22): op_host_services::cli_model_discovery_antigravity::parse_antigravity_models has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/cli_model_discovery_antigravity.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"225e5797af46ad0bb07264667d7366183071a3f521062f1fe4b49ca42e544d66"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_send (cyclomatic 22): WidgetHost::apply_send has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b35a4116d8b8f8300ee62111145d83a2c49b82d4aaef20a46dd8fb519c449ac"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::dom_io::handle_paste_event (cyclomatic 22): op_host_web::dom_io::handle_paste_event has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cb7f55adaaa09334a21df41d8f172b6aa5f5702184240596b411185addffdb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::declaration_syntax::split_whitespace_top_level (cyclomatic 22): op_html::css::declaration_syntax::split_whitespace_top_level has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef54cbb4b8a3665cf45676fb2598aaf5ef12d895540265cb4c9b710fd7e19a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::script_runner::balance_brackets (cyclomatic 22): op_mcp::script_runner::balance_brackets has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5b90e572232acfc4bc7312c1db94bd6d635c144fa19d82f833973f6ca94402"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::hero_bleed::enforce (cyclomatic 22): op_orchestrator::hero_bleed::enforce has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/hero_bleed.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a020c3516967b4299245ff2075f1516cc8a563ec5ed8d916a501b1391b55d5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::text_fit::collect_text_fit_command (cyclomatic 22): op_orchestrator::text_fit::collect_text_fit_command has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_fit.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a981329be6b6452ddba47ddc28ec3b54d59c86ff3fd4fe26da45af7f8858fe99"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::loop_finalize::fix_theme_variable_polarity (cyclomatic 22): op_orchestrator::loop_finalize::fix_theme_variable_polarity has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"080fca61c35d2febc835b662d81de25fc7e8fd5bd16cff0cc248c634b9645320"}},{"ruleId":"D1","level":"warning","message":{"text":"cjkcheck.main (cyclomatic 22): cjkcheck.main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/qa/cjkcheck.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e560326b80c5d396a7d93d7b2c0532fafa0fdd2df61c67c6af02b05da9c79491"}},{"ruleId":"D1","level":"warning","message":{"text":"picker.startPick (cyclomatic 22): picker.startPick has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/picker.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb72ccbe31fb76a10ed16df990f42bce5fda4168142392bde59df56537b653c8"}},{"ruleId":"D1","level":"warning","message":{"text":"GitPanel::ready_hit (cyclomatic 21): GitPanel::ready_hit 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":"crates/op-editor-ui/src/widgets/git_panel_ready.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a6a0e2a73e0d0b4bbcb11723305d836ca56ca308f1f3cef049010ec73ea853"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_code_complete::syntax_tokens (cyclomatic 21): op_editor_ui::widgets::property_panel_code_complete::syntax_tokens 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":"crates/op-editor-ui/src/widgets/property_panel_code_complete.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1046b308e3c486439e0099d1d85b1ec1e4a84841289424396e33b55278d0dc9f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card (cyclomatic 21): op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card 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":"crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a2a60e2aa312836f23ce6d6b7d9ad6e80ed5634089d8da18c3f6bdd3c3f4c3"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::press_flow::apply_layer_panel_click (cyclomatic 21): op_editor_ui::widgets::press_flow::apply_layer_panel_click 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":"crates/op-editor-ui/src/widgets/press_flow.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9719e8f9b9757ef1de281e4331747bdf634c2c5a1c5da0a1a68b1e363b287e7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::instance::swap_filter::filter_swap_stale_derived (cyclomatic 21): op_figma::instance::swap_filter::filter_swap_stale_derived 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":"crates/op-figma/src/instance/swap_filter.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee19d8edd5ab739501f13afc382633af0000224b3b870a1430325e4f708180"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_cursor_move_inner (cyclomatic 21): WidgetHostNative::apply_cursor_move_inner 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":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c8aa4bbce76c5ce8c85d6ab16e53ddbfcdf2737f1a9a58e84bc6ba296886c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::chat_claude::map_message (cyclomatic 21): op_host_services::chat_claude::map_message 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":"crates/op-host-services/src/chat_claude.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde327c0606c07f315a28ce7946c9618593ba066c41b1d04f0546824da6e31be"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::cli_model_discovery::parse_grok_models (cyclomatic 21): op_host_services::cli_model_discovery::parse_grok_models 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":"crates/op-host-services/src/cli_model_discovery.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4f535f70bbd4d842abb76eb7da2b9eedd679afeec42c6ab6476b4597667a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::paint_menu_modal_and_panel_layers (cyclomatic 21): WidgetHost::paint_menu_modal_and_panel_layers 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":"crates/op-host-web/src/widget_host/paint_overlays.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1849263c9a1d478720cacc663a7a2269f9ff211f4e58401c4cbd3e939511e0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::batch_program_exec_ops::execute_image (cyclomatic 21): op_mcp::batch_program_exec_ops::execute_image 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":"crates/op-mcp/src/batch_program_exec_ops.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c148f7c6e81c449a99e2712c86200339496358c9be4845db69950db62ca7f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::plan_normalize::normalize (cyclomatic 21): op_orchestrator::plan_normalize::normalize 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":"crates/op-orchestrator/src/plan_normalize.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"338711dc0bba0131b3888d6e3db6ed6e39be9457205713cc57cc8cb5477c8ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::geometry_spill_diagnostics::collect_sibling_jam_diagnostics (cyclomatic 21): op_orchestrator::geometry_spill_diagnostics::collect_sibling_jam_diagnostics 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":"crates/op-orchestrator/src/geometry_spill_diagnostics.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baf1abcfa13e7bdd26795d215311b858d76a903baf671b9b818281a693d6400"}},{"ruleId":"D1","level":"warning","message":{"text":"op_pen_loader::layout_repair::repair_inferred_horizontal_container (cyclomatic 21): op_pen_loader::layout_repair::repair_inferred_horizontal_container 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":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3699e253bcf8ae72a86686b357496230c5cbafe50a1dc348ace9e88e15020b8"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-rate-rules.verify_rules (cyclomatic 21): verify-rate-rules.verify_rules 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":"deploy/collab-relay-edge/verify-rate-rules.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bcdc2c470f677e54c6c282d2c476f722bb4acf35d6994baa64ca6d44791e27"}},{"ruleId":"D1","level":"warning","message":{"text":"figma_temp_worker.opStartFigmaTempImport (cyclomatic 21): figma_temp_worker.opStartFigmaTempImport has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 365, 388, 352). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/figma_temp_worker.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d945700533632b6908b6cf987536c23b8deb70baced6e443e835d46483c0adff"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chrome_extension_core::design_md_validate::treatment_json_is_valid (cyclomatic 20): op_chrome_extension_core::design_md_validate::treatment_json_is_valid has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9004453337fa4d77dfde3fb1a08b81135261f1ec22f087322b84aa64b23c932"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnerSessionCore::handle_undo_request (cyclomatic 20): OwnerSessionCore::handle_undo_request has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/session_undo.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e6a3a6bc951a212976f0732d535f996242014ae75e438c338edda3d45f3bc"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_relay_client::session::pump (cyclomatic 20): op_collab_relay_client::session::pump has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-client/src/session.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"56956930dfd652ba610e4ec8a04d8d905a87b500578e0bef65d119cd2f13f99f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_relay_server::connection_wait::wait_for_pair (cyclomatic 20): op_collab_relay_server::connection_wait::wait_for_pair has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection_wait.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac36e411fec2f092b51aac3e20bfa6ec9196efe392fbb9e55d04a1cd24fbf114"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_smoke::fault_owner::retry_exactly_once (cyclomatic 20): op_collab_smoke::fault_owner::retry_exactly_once has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92701de18bc07be3a4ca6bb52bee96bb6e3c445052af8ab6d2c33a5f9e215ec"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_import::scale::scale_svg_path (cyclomatic 20): op_editor_core::svg_import::scale::scale_svg_path has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/scale.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d73fbdce96fc131d70a08eeb394b439ebaaa3d6b79f0d58588fd0a09c0293"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_instance::paint_component_block (cyclomatic 20): op_editor_ui::widgets::property_panel_instance::paint_component_block has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_instance.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d843e5dfbec0553c87f9ca8e87ee28bd6100375cedd27a4319b1eee7009dced0"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar (cyclomatic 20): op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c528ab0686356c599b2fb1817a023710b699b7e5275abf65223948cdf64063"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::design_session_workers::finish_design_success (cyclomatic 20): op_host_desktop::design_session_workers::finish_design_success has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session_workers.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91846ff673f73f0a03827b147365a1cdb5525cedae3b76f9ba573609c04eaf0"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::design_md_host::run_mcp_design_md_provider_blocking (cyclomatic 20): op_host_desktop::design_md_host::run_mcp_design_md_provider_blocking has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_md_host.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"400269ab640784487a52908b42be0127c5911c98a3a1546139ff39b37644f5bc"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltInProvider::send (cyclomatic 20): BuiltInProvider::send has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_runtime.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9962ee624edc3354afceda01ee79cdb996c43b4d5d7ca2fe9ce0e78819556b47"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::ai_proxy::proxy_builtin_for_identity (cyclomatic 20): op_host_services::ai_proxy::proxy_builtin_for_identity has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/ai_proxy.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"44446d58c582a7de0b19f5b4ea7f1f3a51ed11828c0f4d88e76d51d3895945d6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::web_credentials::validate_and_merge (cyclomatic 20): op_host_services::web_credentials::validate_and_merge has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_credentials.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faeb9647070578fafb03adc563ba82c7e498c93fb0a848d99229e875c80f19c"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_release (cyclomatic 20): WidgetHost::apply_release has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/release_input.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b3253fbdb31946200565232e4fef4d64673b4797a719381f9883d94081815e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::web_settings_validation::validate_credential_semantics (cyclomatic 20): op_host_web::web_settings_validation::validate_credential_semantics 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. This is NOT this file\u0027s highest cyclomatic complexity: SettingsValidationError::fmt (cyclomatic 26) 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":"crates/op-host-web/src/web_settings_validation.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a816ad9564623d20e3b3ec3ff3ff72b39b58835cc429bee5c62e95dfcd02dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::mapper_visual::map_gradient (cyclomatic 20): op_html::mapper_visual::map_gradient has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a87a59c73f70c4b554c424286aee9900650e7179c71115e563a44528d0db769"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::mapper_grid::wrap_grid_rows (cyclomatic 20): op_html::mapper_grid::wrap_grid_rows has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d8615491060895ec4eb1d046dcf69ad98be961f669822ef81f01e57344f99f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::script_runner_dotted_keys::repair_dotted_object_keys (cyclomatic 20): op_mcp::script_runner_dotted_keys::repair_dotted_object_keys has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner_dotted_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f49436cd4f75725d06e938f5bcd46e4126458eb120b8a5e520dd773620af734"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::batch_design_normalize::normalize_pencil_autolayout_dialect (cyclomatic 20): op_mcp::batch_design_normalize::normalize_pencil_autolayout_dialect has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_normalize.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf186d7a9a685f68a2fc984ac76ff94b7dcac973523f9a0cf3483523d523fe"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::validation_fixes::is_valid_fix_value (cyclomatic 20): op_orchestrator::validation_fixes::is_valid_fix_value has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65e9557d7520e7f43215060e7e5ab80a68082152a4481a52d92c321693e93f7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::geometry_overflow_fixes::collect_text_overflow_fixes_with_context (cyclomatic 20): op_orchestrator::geometry_overflow_fixes::collect_text_overflow_fixes_with_context has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc032ab6563c57d0e7852298fe72a543f16e4ef759e893e61f8d79bf2cb8bbc5"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::plan_coverage::required_sections (cyclomatic 20): op_orchestrator::plan_coverage::required_sections has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_coverage.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7401d1a95b0ef2cb87e6a8018c3e11ed25484d851e6441a4976d49506d4340"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::avatar_repair::avatar_slot_repair (cyclomatic 20): op_orchestrator::avatar_repair::avatar_slot_repair has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/avatar_repair.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e69ab242ed28228b7ca43afb7724c54f0cb12cdf98336dafa3de4c1160aa9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ai_skills::style_guide::token_table::extract_table_colors (cyclomatic 19): op_ai_skills::style_guide::token_table::extract_table_colors has cyclomatic complexity 19 (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":"crates/op-ai-skills/src/style_guide/token_table.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"896558b8492a749c2674c78df9cbc01d4934ebb1bd35a9badd63d60f8aad65a4"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestSessionCore::accept_frame (cyclomatic 19): GuestSessionCore::accept_frame has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest_sync.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9575f31c6e0a27c85d20bd3239dbc801b0d9e6321612dd365bdc76d5e6606c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"TransportConfig::validate (cyclomatic 19): TransportConfig::validate has cyclomatic complexity 19 (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":"crates/op-collab-transport/src/config.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeff04ff0d5c77de43454e9eb5dcbd5f58a8e6cb106fcdcf9129ccb48ee725a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_design_lint::detectors::spacing::walk_edge_section_padding (cyclomatic 19): op_design_lint::detectors::spacing::walk_edge_section_padding has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52a9182ff6a79288c6b2e7fd083b919f24f082adceeaf7671eaea97daa6b637"}},{"ruleId":"D1","level":"warning","message":{"text":"op_design_lint::detectors::typography::first_solid_color (cyclomatic 19): op_design_lint::detectors::typography::first_solid_color has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/typography.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"351bea56e95bcf9213aaa1aa9a5870bde9b0598521c4690189adbafa8ad74fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"CollabGatePolicy::check (cyclomatic 19): CollabGatePolicy::check 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. This is NOT this file\u0027s highest cyclomatic complexity: EditorCommand::collab_gate_action (cyclomatic 46) 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":"crates/op-editor-core/src/collab_gate.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0032e5d621debc3cb42798f6f405f946d838ec7c779817b62becceda4a88f7d3"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::scene_template_catalog::parse_scene_template_catalogue (cyclomatic 19): op_editor_core::scene_template_catalog::parse_scene_template_catalogue has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: op_editor_core::scene_template_catalog::scene_template_document_route (cyclomatic 81) 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":"crates/op-editor-core/src/scene_template_catalog.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bc6111f2b92766cc73e139c30a7a3db721f43ded0bb38541c8f2d5156b19b0"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_import::lexer::parse_attrs (cyclomatic 19): op_editor_core::svg_import::lexer::parse_attrs 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":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd736590a535dfd8e061c382a1751907ec1ac7a46fc0373e0f68d80788f74bd"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::command_style_replace::apply_replacement (cyclomatic 19): op_editor_core::command_style_replace::apply_replacement has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0cd7f447314eff0e955702f5e949befa89f5e49933be974479404d4bff3c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::host_variables_commit::commit_row_draft (cyclomatic 19): op_editor_core::host_variables_commit::commit_row_draft has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_variables_commit.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"023c0ef1fccf7f933cb4c9a7bdfeaff0c14cdfda98c7e6174604edbe5d406da2"}},{"ruleId":"D1","level":"warning","message":{"text":"AIChatPlaceholder::footer_hover_at (cyclomatic 19): AIChatPlaceholder::footer_hover_at 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":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7893bc605585ff08e33d369cbf6d0f90646bde2bfe5872ea9cef0e13ec36de63"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptCenterPanel::hit_test (cyclomatic 19): PromptCenterPanel::hit_test has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4862cfe19da5e6a1c64ff464542cbbab482520d4a441a40c261ed4ead57d0cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::top_bar_tooltip::tooltip_for (cyclomatic 19): op_editor_ui::widgets::top_bar_tooltip::tooltip_for has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_tooltip.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee32c3cea0795cc5fb3b7bfa706e0a34651bc6c175db72431f4247e0b60031b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::scene_bounds::own_paint_corners (cyclomatic 19): op_editor_ui::scene_bounds::own_paint_corners has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/scene_bounds.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"817111e8a6e6005b06392f3e6fc22f575338b106ff96f6d1032929da43ba9233"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::clipboard::parse_clipboard_html_styles (cyclomatic 19): op_figma::clipboard::parse_clipboard_html_styles has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/clipboard.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"260eb9f2fe1aff0c608066d1244a06130050c28011854b3ee6c299e94a750c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::design_session::pump_commands (cyclomatic 19): op_host_desktop::design_session::pump_commands has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"597853f2822dd98b6c82110257ca1616ef30d67fb25ae01b3f8bf8f32e057489"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_base_tiers (cyclomatic 19): WidgetHostNative::cursor_move_base_tiers 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":"crates/op-host-native/src/widget_host/cursor_move_chrome.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4011aafaa19121711604e88dc48e1dc0c374fbec960f7a19855f86007ac45ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_canvas_select_tier (cyclomatic 19): WidgetHostNative::press_canvas_select_tier has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_canvas_tiers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d003ca35a28e6f6d5050d84d969f4056a3f66c86287e515ab02e8aab7c2b9"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::touch_panel_target_is_visible (cyclomatic 19): WidgetHostNative::touch_panel_target_is_visible has cyclomatic complexity 19 (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":"crates/op-host-native/src/widget_host/touch_panel_gesture.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ffbec7a6676dc0e9a2818c46900cafb88db5d84c60184ad162677d4b9c0bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::design_md_evidence::evidence_provenance (cyclomatic 19): op_host_services::design_md_evidence::evidence_provenance has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"619eb17c9e9d6d6b6c833fec838c30e2fb5965c575386929b5de6f270c3d3f71"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::design_md_evidence::validate_evidence (cyclomatic 19): op_host_services::design_md_evidence::validate_evidence has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"395b2b54c4e14141786f7962da1d463dcdfc25774adbbf5e8e740bea854096d2"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_wheel_with_canvas_delta (cyclomatic 19): WidgetHost::apply_wheel_with_canvas_delta 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":"crates/op-host-web/src/widget_host/wheel_pan.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c64fd8aa58f1c548444ac32f4303c6559c91ceb17546e2de8d1fc3b88d52e6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::srcset::parse_srcset (cyclomatic 19): op_html::srcset::parse_srcset has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/srcset.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef00db89c14513321767428eb9c18e80e8301d1e2267f19635d5b6dc48a1634"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::html_encoding::encoding_from_meta_attributes (cyclomatic 19): op_html::html_encoding::encoding_from_meta_attributes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/html_encoding.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7569ede5b2a4f8ec1ced9fca04bcabe9303ee70c512b6b72cc49b6ae2abf20b9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::codegen_plan_store::submit_chunk_result (cyclomatic 19): op_mcp::codegen_plan_store::submit_chunk_result has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d84bcad62d3af87bbdce50d88dbeb825ac51e8a36b7122c645149c23c791ce"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::loop_finalize::ensure_text_fill_forest (cyclomatic 19): op_orchestrator::loop_finalize::ensure_text_fill_forest has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (walk, resolve_hex, has_present_fill). 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":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a6969dd71b669033b8f2a3a7f2a149aaafaf227ec550f0fc48c05b16422d26"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::subtask_completeness::parse_cjk_number (cyclomatic 19): op_orchestrator::subtask_completeness::parse_cjk_number has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/subtask_completeness.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c09c29d73d5547e253e7aebb90c82845b175154cbb549025b0a53b82062e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::prompt_components::component_category (cyclomatic 19): op_orchestrator::prompt_components::component_category 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":"crates/op-orchestrator/src/prompt_components.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd93dff58d1f4bae3506fce7e4ec926ecb4c3121d76253cead3d1d9641910c5"}},{"ruleId":"D1","level":"warning","message":{"text":"PreviewSession::reconcile (cyclomatic 19): PreviewSession::reconcile has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/app_mode.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13fad1a35158bc760b9f4a5529915d3229f85eb94826d7773ba40c2dfd1a1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"run_matrix.parse_corpus_yaml (cyclomatic 19): run_matrix.parse_corpus_yaml 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":"scripts/ab-v9/run_matrix.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"479504733aa56e93f84df5fe24e6623b9912040d83ba7a02506c7fac5d862682"}},{"ruleId":"D1","level":"warning","message":{"text":"extract-op-auth-candidate.main (cyclomatic 19): extract-op-auth-candidate.main 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":"tools/extract-op-auth-candidate.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00a849806bc4c4ea1b75d2e555c9c8fff537dfadcf2c3eee24fa87cbd82bc3d"}},{"ruleId":"D1","level":"warning","message":{"text":"collectDesignEvidenceInPage::toHex (cyclomatic 19): collectDesignEvidenceInPage::toHex 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":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c324f26072434266a80372446f63ee356b78ab07d7c4a62aa6682b46d6d02d"}},{"ruleId":"D1","level":"warning","message":{"text":"collectDesignEvidenceInPage::componentSample (cyclomatic 19): collectDesignEvidenceInPage::componentSample 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":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"499397b21fcaa625936d9b19fddcd5eddeb74a58950d78abb203661ed8636356"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicToolCollector::handle (cyclomatic 18): AnthropicToolCollector::handle has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai/src/chat_tool_sse.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"42848f6a33301ffecd5423a419e56f10bcba6078e52724c3d6814ec764b1235e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_codegen::codegen_html::emit_node_html (cyclomatic 18): op_codegen::codegen_html::emit_node_html 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":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82477b329263a331664ee9410eecfce6d6b0acbf164be69df0fbe44521790f4"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnerSessionCore::handle_submit (cyclomatic 18): OwnerSessionCore::handle_submit 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":"crates/op-collab/src/session_submit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a0776901ade75e4d8d79da53b32cedff4c9dec3ebf43b0152129da0bc709c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_design_lint::fixes::set_property (cyclomatic 18): op_design_lint::fixes::set_property has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/fixes.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9b7eef29300f772f468cfe5c97de3237871df796d0dc572342fe6f1c2d1585"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::icon_path_normalize::absolute_segments (cyclomatic 18): op_editor_core::icon_path_normalize::absolute_segments has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eaa011fc7b9872641a50c271c6912da875450a77841819107e627c9d0b4fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::prompt_center_catalog::parse_prompt_catalogue (cyclomatic 18): op_editor_core::prompt_center_catalog::parse_prompt_catalogue has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/prompt_center_catalog.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"703d79bccd5ba8714d0652d66b54ae9d9881b97ac64a90558c0c7ac97395a558"}},{"ruleId":"D1","level":"warning","message":{"text":"AIChatPlaceholder::resize_edge_at (cyclomatic 18): AIChatPlaceholder::resize_edge_at has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9919b00978a87427063e740941c6c88a5a07110a3318c5cd40ad22fef40e834d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::prompt_center_press_flow::press_prompt_center (cyclomatic 18): op_editor_ui::widgets::prompt_center_press_flow::press_prompt_center has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_press_flow.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a746b65da031831e2265d2b1092fbcd8b9db52a22d310b99d555a29736e60c0"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_form::paint_identity (cyclomatic 18): op_editor_ui::widgets::agent_settings_builtin_form::paint_identity 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":"crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"62967c84727f6658f4cf6dc57732ec55248c44764b6d9ac299c06f3527b8f9bb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::chat_session_launch::launch_if_pending_inner (cyclomatic 18): op_host_desktop::chat_session_launch::launch_if_pending_inner has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session_launch.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e55f5f80d88839d0f7d841bcbe52d05ff42a98b1dbc07a90dad4298ac61f3"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::ai_chat_rect (cyclomatic 18): WidgetHostNative::ai_chat_rect has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ai_chat_geometry.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9621d3c9fc4edee593dbb5003d14b5055351adcaf31c782068700e308efae1f"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::cursor_move_menu_tiers (cyclomatic 18): WidgetHostNative::cursor_move_menu_tiers has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"91564364baacc5ee6d162f6de636d2ae1a382aa57259a06cb105dd0c17f7b918"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::paint_left_rail (cyclomatic 18): WidgetHostNative::paint_left_rail has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint_rail.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0982d803048ee4e1a483acabe6906ebe624ab8763ccf298a2ae41e796d95937"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_property_panel_tier (cyclomatic 18): WidgetHostNative::press_property_panel_tier has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_property_tiers.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"283af1e154b45538cb102aad09c48b5fb34565b2eaba5b4f1ef7d1755b8e41c7"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::apply_input_select_all (cyclomatic 18): WidgetHostNative::apply_input_select_all 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":"crates/op-host-native/src/widget_host/shortcuts.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d407a7364f762cb7728eab83599e8a0b91a34c4e5051f8fd070854c2504c8"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::run_workspace_action (cyclomatic 18): WidgetHostNative::run_workspace_action has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/workspace.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa41a3e4f3c33c39dd0d340dcfbd8c6d14f612f7d29995a0ca6278fa84d2b48"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfiguredBuiltinProvider::send_inner (cyclomatic 18): ConfiguredBuiltinProvider::send_inner 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":"crates/op-host-services/src/chat_builtin_http.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd64680b1479f28e3ed32674b5b112ff3dccc7ccb7c5e858ad0fa2a42411743d"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeProvider::send_inner (cyclomatic 18): ClaudeCodeProvider::send_inner has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_claude.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1ecaf52a0b0ad6d06326f9a04e0a301f117f3213515438ff17b7b5a7388c99"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route (cyclomatic 18): op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"defb5048945e65f62d78db790ad39cd81065306efed4f9f350bcc394c88ea654"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::export_html_structured::unexpressible (cyclomatic 18): op_host_services::export_html_structured::unexpressible 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":"crates/op-host-services/src/export_html_structured.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb66663f60b1c6ef3e2a73572e206c4525ec7658216d69e847e397eb823ebdc3"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_git_text (cyclomatic 18): WidgetHost::apply_git_text has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_git.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1863d56a911db90607d4abb900098deefad4496d012bfc3ecd760e1ad05d4a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_press (cyclomatic 18): WidgetHost::apply_press 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":"crates/op-host-web/src/widget_host/press.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe72c9c4499adb1d7c88740cbd85c3f0e4313c9c74067c0d82f555185ee8a46a"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_pan_gesture (cyclomatic 18): WidgetHost::apply_pan_gesture 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":"crates/op-host-web/src/widget_host/wheel_pan.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d961d6b8562928c667954f7f41bc6b918af44af610d2035bd06d8204e89ed32f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::special_image::apply_intrinsic_axes (cyclomatic 18): op_html::special_image::apply_intrinsic_axes has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1218d6a189ee61ec88d63196eccda2151f164b8d08b5e6dab21edba7d78622c9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::special_image::parent_content_box (cyclomatic 18): op_html::special_image::parent_content_box has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbeb8d3430d4a27b407885cbad589fb3b396b5ee4fa04dd24b4cb19930415f2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::resources_css_urls::unescape_css (cyclomatic 18): op_html::resources_css_urls::unescape_css has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources_css_urls.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b62b87bbe0bfedca4298cae093eaa67b21fd71b9721f86fc877169870d194b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::parse::renest_by_parent (cyclomatic 18): op_orchestrator::parse::renest_by_parent has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/parse.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b2f0f2ddc6e5337b674e9d6edb450b86ce0fbd94965b16d4ec8a2a409fe0a8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::role_post_pass::micro_surface_radius::is_compact_capsule_surface (cyclomatic 18): op_orchestrator::role_post_pass::micro_surface_radius::is_compact_capsule_surface has cyclomatic complexity 18 (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":"crates/op-orchestrator/src/role_post_pass/micro_surface_radius.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"848d2e79b6c69ac10c6812171ce637aadf3769b7ca6f0d726f6c07a1b0faa6aa"}},{"ruleId":"D1","level":"warning","message":{"text":"OpEngineHost.drainShellActions (cyclomatic 18): OpEngineHost.drainShellActions 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":"packaging/ios/Sources/OpEngineHost.swift"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8c32b47abe43b5f491461f8a547677c6238674ba93a16f15265949cd54be32"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web.debugString (cyclomatic 18): op_host_web.debugString 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":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"174e65aa8e37d483934d0ea65aed2e5b640aa332c1ae3737e36ba56b337ca4e2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web.debugString (cyclomatic 18): op_host_web.debugString 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":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd9c9185fc583ba71ce741e951276f37a29d49ef14f45441765dc22065d4978"}},{"ruleId":"D1","level":"warning","message":{"text":"codegen-prompt.parseCodegenOutput (cyclomatic 18): codegen-prompt.parseCodegenOutput has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. 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":"packages/op-vscode/src/vscode/codegen-prompt.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e13f484b36ee04661bcbca63295c9e6484a4054d272e05459da2ee148e1694b"}},{"ruleId":"D1","level":"warning","message":{"text":"capturePage (cyclomatic 18): capturePage 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":"packages/op-chrome-extension/capture.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9134bba092cfdf9017aa5730f24708ef255edf13f61d42a819b0c103e3d32bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ai_skills::style_guide::parser::extract_typography (cyclomatic 17): op_ai_skills::style_guide::parser::extract_typography has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/parser.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6ac3dd55ff9103821383c3965a6fd83086dbf8b81101d7d64e08cb8a860895"}},{"ruleId":"D1","level":"warning","message":{"text":"op_auth_bridge::collab_claims::validate_claims (cyclomatic 17): op_auth_bridge::collab_claims::validate_claims has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e112ce2748d0e776252e3011d1ded5f3af4c1a359fbb2f7c1c06be901c1287"}},{"ruleId":"D1","level":"warning","message":{"text":"op_cli::parse_args (cyclomatic 17): op_cli::parse_args 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. This is NOT this file\u0027s highest cyclomatic complexity: op_cli::run (cyclomatic 23) 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":"crates/op-cli/src/main.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f471ebda977b88986945c098481e34053606502433c0eb464b6848936362a1ea"}},{"ruleId":"D1","level":"warning","message":{"text":"op_collab_relay_server::parse_arg_values (cyclomatic 17): op_collab_relay_server::parse_arg_values has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/main.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8fe9cbede52d63884a09b6f0ef70a53bb8b690737996a196afc2b93bddf302"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::cmd_set_ellipse_arc (cyclomatic 17): EditorState::cmd_set_ellipse_arc has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node_attrs/state_ops.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c780ae6ffb8431e5d0858c45b3c9375c0b347d6b2830fca5a278563bf8e2e73e"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorState::move_node_to_drop_target (cyclomatic 17): EditorState::move_node_to_drop_target has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/drag_mutators.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8dc43d671e3a7a53296e18bb7f41c9b3db6bc210c7b81676939340a3f59d41"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::instance_override::route_display_state (cyclomatic 17): op_editor_core::instance_override::route_display_state has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eea492aa14c6f18ed1c20c14f9d9e888086346673b454c7629cc812424f09e1"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerPanel::hit_test (cyclomatic 17): LayerPanel::hit_test has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel_hit.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"428cb7ebd748512be55373ee96bbab881b7c0ecedc1b65d72779ac841961268b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::variables_panel::menus::paint_menus (cyclomatic 17): op_editor_ui::widgets::variables_panel::menus::paint_menus 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":"crates/op-editor-ui/src/widgets/variables_panel/menus.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f077460624dd96bf2173501f6d70c91cfbe66eaa2d030caf67a7f66498bb45"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_paint_mask::push_path_mask_clip (cyclomatic 17): op_editor_ui::widgets::canvas_viewport_paint_mask::push_path_mask_clip has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint_mask.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ebea752cf6a35602003404d0241ae3abbaeaa59c583f64b9f0f1282bda87f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_acp::hit_test (cyclomatic 17): op_editor_ui::widgets::agent_settings_acp::hit_test has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4f01a67fa250afaf307fc87a239622c6c0b417041563076cc36857b1f8406a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_acp::paint_field (cyclomatic 17): op_editor_ui::widgets::agent_settings_acp::paint_field 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":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c38bf796e32deae42353aef77072f594343eae2c4460fe92c0acd4e4398ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::host_canvas_geometry::path_anchor_hit (cyclomatic 17): op_editor_ui::widgets::host_canvas_geometry::path_anchor_hit has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/host_canvas_geometry.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"371ea2b69e68d72188e81f88c6d9e739d925f98e67915f608d86773ad81bdd78"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_generation_scan::node_paints_own_visual (cyclomatic 17): op_editor_ui::widgets::canvas_generation_scan::node_paints_own_visual 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":"crates/op-editor-ui/src/widgets/canvas_generation_scan.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"99574929ac22dd2be66ae3b48f66397c871717dfba200e9b64601c8f093f1734"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_input_layout::push_fill_action_rects (cyclomatic 17): op_editor_ui::widgets::property_panel_input_layout::push_fill_action_rects has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5ff402ea4c0cfe36eb17b362b38ff88914a1eafaa6da7a28579c209e747319"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::converters::convert_vector (cyclomatic 17): op_figma::converters::convert_vector has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/converters.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0aec0c4611367a632555d32b124437e9e6bff2b2e45d2dc8a1d496bfdd843"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::mcp_integrations::config_path (cyclomatic 17): op_host_desktop::mcp_integrations::config_path 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":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3721a8bce9de965dc2a5d187eebf021be118f806077b8b848cb9acd1a0ff52"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::figma_import_session::pump (cyclomatic 17): op_host_desktop::figma_import_session::pump 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":"crates/op-host-desktop/src/figma_import_session.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f54b69ca2da07e95228d9d24320643c2b8591dcf31b3f3ed6b116ef15bb7d8"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::dispatch_icon_picker_press (cyclomatic 17): WidgetHostNative::dispatch_icon_picker_press has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/icon_picker_press.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a052c73bf6b075b3d261bb970aa2dc0419f03e2b3eb2f0429d367dc1449de07"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::serve_rest_restore (cyclomatic 17): WidgetHostNative::serve_rest_restore has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint_pan_cache.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9ad092e3639f3b36ead68d47e44b8fb0a734f883e9ed6830065a491c6612f9"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_top_bar_tier (cyclomatic 17): WidgetHostNative::press_top_bar_tier has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c61f9d37e62ad808a874b6580a944a5d4d7155176bf6c0aedd6dcf246c069b"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::web_canvas_server::run_loop::run_web_canvas (cyclomatic 17): op_host_services::web_canvas_server::run_loop::run_web_canvas has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/run_loop.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6f38cfd120ab72a8fe56525e8b5f0097c10ca77f528e82d93bd2bab5ac208e"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::dispatch_file_menu_press (cyclomatic 17): WidgetHost::dispatch_file_menu_press 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":"crates/op-host-web/src/widget_host/chrome_menu_press.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9740667e27976a1a8731115e63d68882f0ef2f3b451a5de598531576f6735732"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::apply_git_send (cyclomatic 17): WidgetHost::apply_git_send has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_git.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff158b120f1144205e6654c029f7a4841a2eee306163aefde5b43debe5900c9d"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::press_topmost_overlay_tiers (cyclomatic 17): WidgetHost::press_topmost_overlay_tiers has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4223a550fae1872f6662b76f29221c90f987913e993709401771618b1ece18"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::live_sync_glue::push_document_if_changed (cyclomatic 17): op_host_web::live_sync_glue::push_document_if_changed has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync_glue.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aeca64712509f241691b32948255f4f46c1f20887ddc53d11564a243164bc8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::web_auth_sync::apply_login_status (cyclomatic 17): op_host_web::web_auth_sync::apply_login_status has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_auth_sync.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c2c609faa9ecd1a31a67e8a8ce01f630b959c885ff616cced2ddacc2f12699"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetParser::at_block (cyclomatic 17): SheetParser::at_block has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7acdec8644184563d3ee23b12ba78f80c713bf09d86f6db8d9cd050667853d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::mapper_grid::top_level_tokens (cyclomatic 17): op_html::mapper_grid::top_level_tokens has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"254698eab405a0145f05a7ec8b2482d95e10d943d0c8d40ad2511c3414e4aa3e"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::import_html_with_resources (cyclomatic 17): op_html::import_html_with_resources has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42ff15dc7b047c0df67acf720603c4dbd506623d4eb37ebb9271fa1bb6685c3"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::declaration_syntax::split_top_level (cyclomatic 17): op_html::css::declaration_syntax::split_top_level 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. This shape REPEATS in the file: one other method here (op_html::css::declaration_syntax::find_top_level) 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":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48a7a4c85cfe81f57dd7cfcfc2c1bb81788db335c9b86af8b122f7ca9e567ab"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::declaration_syntax::find_top_level (cyclomatic 17): op_html::css::declaration_syntax::find_top_level 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. This shape REPEATS in the file: one other method here (op_html::css::declaration_syntax::split_top_level) 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":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee293f4a5afcf141f8de06311abb4566566693286d3b788170475da87bebb137"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::mapper_visual_syntax::split_whitespace_top_level (cyclomatic 17): op_html::mapper_visual_syntax::split_whitespace_top_level has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_visual_syntax.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c121bc4cf914efb035d782c37a911fe109cc33fec27e3ac9567cc3aa01e09df5"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchGet::call (cyclomatic 17): BatchGet::call has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: op_mcp::batch_get::node_type (cyclomatic 21) 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":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0026e8318b541991c493fbd4b63d42ef8e28221a997ada372649141ff41b4e12"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::codegen_plan_store::validate_plan (cyclomatic 17): op_mcp::codegen_plan_store::validate_plan has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d87e3a015262a2bd1c9d434148d47d4dae03ec077f6404058a8c3e172fa7a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::batch_program::explicitly_sized_append_lines (cyclomatic 17): op_mcp::batch_program::explicitly_sized_append_lines has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_program.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"763813d0f78be68145032c57aadfb01c455c6b138c5420ebd71edf8ff17956e7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::role_layout_post_pass::fix_horizontal_overflow (cyclomatic 17): op_orchestrator::role_layout_post_pass::fix_horizontal_overflow has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_layout_post_pass.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"de179e64f1de2adae65a682f9275631bac44836b9ac7b7681bf1bd04eb7b7c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::plan::explicit_mobile_size (cyclomatic 17): op_orchestrator::plan::explicit_mobile_size has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c56c3ce72417e88c1d74885b02a12bc87438af67667b3292ef58594fd614f9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::geometry_overflow_fixes::collect_frame_overflow_fixes_with_context (cyclomatic 17): op_orchestrator::geometry_overflow_fixes::collect_frame_overflow_fixes_with_context has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"06093539094f73a6064e04b92094eac20d15c27ebe5fbe4d52778bc5106dea3d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::category_grid_density::repair_tile (cyclomatic 17): op_orchestrator::category_grid_density::repair_tile has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e4a05f14929884e9de67bf0c184c88318b6e2c5c77c80ae88bf8abd55678ab"}},{"ruleId":"D1","level":"warning","message":{"text":"scene_preview_cards.main (cyclomatic 17): scene_preview_cards.main 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":"templates/step0/_generators/scene_preview_cards.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9c2a04d279fac3c8da2238c62ca91c5f0648012b325abfa14e047143dd496"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ck_bridge.opCkMakeRuntimeShader (cyclomatic 17): op_ck_bridge.opCkMakeRuntimeShader has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d03359199b5e95f44e8cf99435bdae13015a28cee54bc313b8b1e717deb377"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot-extractor.inlineSegments (cyclomatic 17): snapshot-extractor.inlineSegments has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdf41482ed1eccc957fcaa86f5dbb52d91e16579fc6bf1c6bd7861f64047706"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n.t (cyclomatic 17): i18n.t 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":"packages/op-chrome-extension/i18n.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91f49f04d696434b015f458a490497378f55b481717a1043a55b5d59eedcb5"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiToolCollector::handle (cyclomatic 16): OpenAiToolCollector::handle has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai/src/chat_tool_sse.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7832aad38ed920672c434feb77adb1b4d1a0d39b0a5c6378c5c6f4989d497279"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ai_skills::budget::trim_by_budget_pinned (cyclomatic 16): op_ai_skills::budget::trim_by_budget_pinned has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/budget.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec4ed1810d6932bc37d8e5c879cdb45ce90cf4601d286cc9c8287e01d87950d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ai_skills::frontmatter::entries (cyclomatic 16): op_ai_skills::frontmatter::entries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/frontmatter.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"016180eabd1d07ed415f7a9de9af36ae9027c31c1755eb6dcf658a478f7eff4d"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ai_skills::frontmatter::parse_skill_frontmatter (cyclomatic 16): op_ai_skills::frontmatter::parse_skill_frontmatter has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/frontmatter.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d7f319541007aac0029504995a30e2f85d30e3ee90c9cb7f5e04667087b4bb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chat_agent::design_context::collect_design_facts (cyclomatic 16): op_chat_agent::design_context::collect_design_facts has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_context.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e7c0b1598347561e3312db142a41ad141a749446cd92ec330972517ba6a793"}},{"ruleId":"D1","level":"warning","message":{"text":"op_chat_agent::design_agent_diagnostics::scan_container_intent (cyclomatic 16): op_chat_agent::design_agent_diagnostics::scan_container_intent 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":"crates/op-chat-agent/src/design_agent_diagnostics.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"724d39dc75dad2b3c70fab01df3113b8a8bc9791610acd52c5ff581d6d95c636"}},{"ruleId":"D1","level":"warning","message":{"text":"GuestSessionCore::handle_undo_result (cyclomatic 16): GuestSessionCore::handle_undo_result has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest_sync.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe62cc039418ffc477d3393c805d839cfb9ec8140dc8bcc672b37797f02b95c9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_design_lint::detectors::siblings::check_consistency (cyclomatic 16): op_design_lint::detectors::siblings::check_consistency has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/siblings.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d35973673f0e10cfc39dd4252109b4fa5b042c4401e56469a879ee22e300da"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_path_data::tokenize_path (cyclomatic 16): op_editor_core::svg_path_data::tokenize_path has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"75656565b2f500ed1524e7d1e81af632776214b9f90bd36d7c91d23b6e3e94d6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::variables_resolve::roots_have_tokens::node_has_token (cyclomatic 16): op_editor_core::variables_resolve::roots_have_tokens::node_has_token has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/variables_resolve.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aa692b4a1c0d306b7f50332790b23039114dc5c7735bae144d5f47a75aa0fc"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_core::svg_import::path_data::tokenize_path (cyclomatic 16): op_editor_core::svg_import::path_data::tokenize_path has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a86f9979f7f3dc1066e82677c84384fa0ca66bd9dfbc511a65e0788f905871"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_host_core::codegen_runtime_state::pump_codegen_state (cyclomatic 16): op_editor_host_core::codegen_runtime_state::pump_codegen_state has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/codegen_runtime_state.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3f29efca6e916f24753953645353dbf520c615c30d19651af2a1158e38a482"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptCenterPanel::hover_at (cyclomatic 16): PromptCenterPanel::hover_at has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"51154b3c882b1c460223cd39d3d6a055fa7214d4520ad26ae09fb911277dbea8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_parts::paint_preset_menu (cyclomatic 16): op_editor_ui::widgets::agent_settings_builtin_parts::paint_preset_menu has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_parts.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ec143935f57f412bf21fb04f6de70194bb6dc5023a7f06f157564207e903f7"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_model_menu::paint_model_menu (cyclomatic 16): op_editor_ui::widgets::agent_settings_builtin_model_menu::paint_model_menu has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aadb33fa22f8e262a058d91bf23e1a50a345e5c541e46c32adc3dd3570e4554"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_mcp::paint_server_row (cyclomatic 16): op_editor_ui::widgets::agent_settings_mcp::paint_server_row 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":"crates/op-editor-ui/src/widgets/agent_settings_mcp.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"20370241c98713acfa64410ad64bde8553ad2a365e2aff8ef4960b50add369af"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_paint::shapes::paint_ellipse (cyclomatic 16): op_editor_ui::widgets::canvas_viewport_paint::shapes::paint_ellipse has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint/shapes.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a5fa15b89855c714d5f6dd362f2902f4892b1f1766423daf380b0c5c183cd8"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_images_parts::paint_profile_field (cyclomatic 16): op_editor_ui::widgets::agent_settings_images_parts::paint_profile_field 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":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"00157485d3d3cbd63db5b39df84bf446b8b0dbc90dec8ca5bc4971c52f9a3a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_code::code_action_rects_with_bottom (cyclomatic 16): op_editor_ui::widgets::property_panel_code::code_action_rects_with_bottom 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":"crates/op-editor-ui/src/widgets/property_panel_code.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10c2582753c31a508553ec2d2678f66bde6d492eb289ec00db8da95d2f87956"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::vector_decoder::decode_vector_network_blob (cyclomatic 16): op_figma::vector_decoder::decode_vector_network_blob 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":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a5ed03a37dc3198cb6dce2784b65b192872d4d98d685cf5b1a736dd5d32c9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::text_mapper::parse_font_weight (cyclomatic 16): op_figma::text_mapper::parse_font_weight 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":"crates/op-figma/src/text_mapper.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"75145171b66a21242bd350dac1aa23bf245c8bc86fe1f5191d657689e3470ced"}},{"ruleId":"D1","level":"warning","message":{"text":"op_figma::instance::assignment::seed_assignments_from_instances::collect_geom (cyclomatic 16): op_figma::instance::assignment::seed_assignments_from_instances::collect_geom has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a630486f530b0560a012e7c4a5aa2971b9c53e2c62668770e1b91b95a97a0c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_desktop::chat_session::execute_tool_requests (cyclomatic 16): op_host_desktop::chat_session::execute_tool_requests has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"af57b1860718800faacf9a858ad6d9e50f82433be0d839a358ef529c1d660016"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::update_dropdown_hover (cyclomatic 16): WidgetHostNative::update_dropdown_hover has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/geometry.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d45deed6fa20722af2fdc5f4aa744a66d5df490e87232d5d762382422bbb76"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHostNative::press_mobile_modal_surface_tier (cyclomatic 16): WidgetHostNative::press_mobile_modal_surface_tier has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"16802d968469588ec2014038645bb675edfa48e880b3f4732e7ab50d7afd7df4"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportItem::call (cyclomatic 16): ExportItem::call has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/export_item_tool.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d5b313e6372c48583f4dca79e52c10b16396ca3a6b95a5c2160596417bdd2"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::design_md_evidence_roles::from_sanitized_json (cyclomatic 16): op_host_services::design_md_evidence_roles::from_sanitized_json 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":"crates/op-host-services/src/design_md_evidence_roles.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9534d39e7c740a40a1132f85b52386c1438a36f0c4cfa1bde0f7582c25de6a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_services::chat_subprocess_parse::parse_line (cyclomatic 16): op_host_services::chat_subprocess_parse::parse_line has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess_parse.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca41e8a99d72ad7e027961df7ba59f62fd17659bb9f53932e4f3a957e80ac26"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetHost::press_top_bar_tier (cyclomatic 16): WidgetHost::press_top_bar_tier has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"518b8777a9a87c06d67bbdcded1b22b26f88d37db6885735268a83130f798e39"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::widget_host::group_ops::trace_grid_contours (cyclomatic 16): op_host_web::widget_host::group_ops::trace_grid_contours has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/group_ops.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdde56342520487796209e67873f9e4d28b05744f985513f3dd008bc233bd93"}},{"ruleId":"D1","level":"warning","message":{"text":"op_host_web::web_settings::apply_payload (cyclomatic 16): op_host_web::web_settings::apply_payload 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":"crates/op-host-web/src/web_settings.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc4aaa5691eb9d441881b39346e39c8b244bd887ea0dfb0f58acf1a2685d398"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_compound (cyclomatic 16): Parser::parse_compound has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: op_html::css::selectors_parser::parse_simple_pseudo (cyclomatic 18) 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":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5db88abfef99e233c987eb42697b012472fc32b098493b7534a7a0bca2514a6"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::cascade::compute_raw (cyclomatic 16): op_html::css::cascade::compute_raw has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"584c04a14f48b4ed8894a6af033dfb35585e5a726a6841565a2980afc9fb53eb"}},{"ruleId":"D1","level":"warning","message":{"text":"op_html::css::selectors::attribute_matches (cyclomatic 16): op_html::css::selectors::attribute_matches has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef29ba1c5929e229a741795ef4209963b20d827ae57babab89ff69eb00fea76"}},{"ruleId":"D1","level":"warning","message":{"text":"op_i18n::i18n::plural_category (cyclomatic 16): op_i18n::i18n::plural_category has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-i18n/src/i18n/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9734d4fd0f7392ddac036698fa864fedabf16927e5ea8e14d945495509a307"}},{"ruleId":"D1","level":"warning","message":{"text":"op_image_enrich::net::providers::catalog::fetch_openverse_json (cyclomatic 16): op_image_enrich::net::providers::catalog::fetch_openverse_json has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/providers/catalog.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ace8e1ac0c058558dba2d1f4bd5109c2c1a7b96ab6f5e97d5fc8734d365abe"}},{"ruleId":"D1","level":"warning","message":{"text":"op_image_enrich::net::providers::relevance::retain_relevant_hits_enforcing (cyclomatic 16): op_image_enrich::net::providers::relevance::retain_relevant_hits_enforcing has cyclomatic complexity 16 (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":"crates/op-image-enrich/src/net/providers/relevance.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e06b863814bad82895132016465379250cb8e43816a22bbc69c785b007bbea"}},{"ruleId":"D1","level":"warning","message":{"text":"op_mcp::batch_get::resolve_refs_in_node (cyclomatic 16): op_mcp::batch_get::resolve_refs_in_node has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: op_mcp::batch_get::node_type (cyclomatic 21) 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":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11023ab6804e70307bb9783d002b425be206b09eacfbd72f150911b348051d4"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::table_repair::try_reparent_orphans (cyclomatic 16): op_orchestrator::table_repair::try_reparent_orphans has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/table_repair.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fb7c6b1fa7fec79c37f22df3a93d9b2145da1d8d3ee91fc8be65f7612c73f9"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::design_type::mentions_phone_dimensions (cyclomatic 16): op_orchestrator::design_type::mentions_phone_dimensions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/design_type.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf58330f73bf7d9142fd0bc97daca5b6af4024f92d311bdca8e573e57cb077ed"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::text_contrast_repair::first_usable_fill_kind (cyclomatic 16): op_orchestrator::text_contrast_repair::first_usable_fill_kind has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_contrast_repair.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0d8547e23b9996903179fb51763032fd749b9353e6894323ecfd7c2e12d24c"}},{"ruleId":"D1","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::collect_copy_group_triggers (cyclomatic 16): op_orchestrator::cleanup_slide_padding::collect_copy_group_triggers has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"691734ac4b4ac83b69ab55ff99973c13d1d957ee4fa8c002d50d3daa2c1e92ed"}},{"ruleId":"D1","level":"warning","message":{"text":"op_pen_loader::payload::legacy_normalize::auto_layout_order_evidence (cyclomatic 16): op_pen_loader::payload::legacy_normalize::auto_layout_order_evidence has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/payload/legacy_normalize.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"894b612618e2d0db12150376780f29a2d2cdff6d2c1c6e051a5f1e51f38ba87a"}},{"ruleId":"D1","level":"warning","message":{"text":"op_pen_loader::layout_repair::repair_vertical_container (cyclomatic 16): op_pen_loader::layout_repair::repair_vertical_container 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. This is NOT this file\u0027s highest cyclomatic complexity: op_pen_loader::layout_repair::base (cyclomatic 21) 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":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7646b28dd1beb8000573ddd2100d4cb2ddefd380b6641479648f997b026cda"}},{"ruleId":"D1","level":"warning","message":{"text":"op_pen_loader::layout_repair::repair_split_metric_column_content (cyclomatic 16): op_pen_loader::layout_repair::repair_split_metric_column_content 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. This is NOT this file\u0027s highest cyclomatic complexity: op_pen_loader::layout_repair::base (cyclomatic 21) 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":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb0e4128ecc9f1e92ad75132b512f6090039cf8fb7467db6685bf0f55b98ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"PreviewSession::dispatch_input_inner (cyclomatic 16): PreviewSession::dispatch_input_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/input_event.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b31c16501c3d692cc0d78f61a6c7fefaad5a444e245108b1c317c3031f8323"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot-extractor.shapeToPathData (cyclomatic 16): snapshot-extractor.shapeToPathData has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"64940d27df408fb8f55f8b1e80d983f02b5e33653d9b1a7aa6ec1bd4f9f2ea37"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 442, 464). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: failureMessage (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f5f136bd5620d4fdbf429ad9b6a8d780a8fa3fcc3b5a15518607f5face13f6"}},{"ruleId":"D1","level":"warning","message":{"text":"opCkInit::textFirstBaseline (cyclomatic 16): opCkInit::textFirstBaseline 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":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42f64f0b9d4c70964010db973f49a4276a2559356e4d68f80d69f7d73042c54"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ck_bridge.opCkInit (cognitive 469): op_ck_bridge.opCkInit has cognitive complexity 469 (threshold 15). Drivers by points: if/else 186 (258 pts), boolean chains 88, loops 33 (59 pts), ternaries 35 (54 pts), error handling 7 (10 pts) (nesting depth added 120). Of this number, 269 points are the body\u0027s own statements and 200 belong to 42 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"666c4be8a5cc6c514495d0b89520e4f756d7245da3b851be29fe36b0a8ec428e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_cursor_move (cognitive 261): WidgetHost::apply_cursor_move has cognitive complexity 261 (threshold 15). Drivers by points: if/else 125 (217 pts), boolean chains 38, match/switch 2 (6 pts) (nesting depth added 96). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/cursor_input.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c99463e0a80b095e8f8e525493b785c54e78e2f93d5b156a8f9d7e9a349ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"design-capture.collectDesignEvidenceInPage (cognitive 249): design-capture.collectDesignEvidenceInPage has cognitive complexity 249 (threshold 15). Drivers by points: if/else 76 (143 pts), boolean chains 63, ternaries 13 (22 pts), loops 9 (15 pts), error handling 3 (6 pts) (nesting depth added 85). Of this number, 77 points are the body\u0027s own statements and 172 belong to 25 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac08068506944c7c76868de4bc75aebc930e9c7958d470247e401d98aca661b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::apply_instance_overrides_cached (cognitive 248): op_figma::instance::apply_instance_overrides_cached has cognitive complexity 248 (threshold 15). Drivers by points: if/else 67 (186 pts), loops 17 (33 pts), boolean chains 18, match/switch 4 (11 pts) (nesting depth added 142). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8823314e4396ba407f1ad50ed83a070144583f73a9f193424f535c486807008a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner (cognitive 177): op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner has cognitive complexity 177 (threshold 15). Drivers by points: if/else 85 (149 pts), boolean chains 17, match/switch 6 (8 pts), loops 1 (3 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"067cf16920f74f4a9c1fb65ee59b5bf1395fea592b13f012edd2e24297554b97"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::apply_with_allocator (cognitive 173): EditorState::apply_with_allocator has cognitive complexity 173 (threshold 15). Drivers by points: if/else 72 (140 pts), boolean chains 20, match/switch 6 (13 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_apply.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ada83d2b3200303446bf8dbf61809cf5bd734e5c43b0c9762298c64e2337df"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::mcp_serve::registry::rebuild_registry (cognitive 146): op_host_services::mcp_serve::registry::rebuild_registry has cognitive complexity 146 (threshold 15). Drivers by points: if/else 141 (144 pts), loops 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/registry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"99406b94a92a507e720f0b68ef56ed99f48e70dee7190f26fb9c89c84a658939"}},{"ruleId":"D2","level":"warning","message":{"text":"AIChatPlaceholder::hit_test_with_canonical (cognitive 145): AIChatPlaceholder::hit_test_with_canonical has cognitive complexity 145 (threshold 15). Drivers by points: if/else 56 (125 pts), boolean chains 12, loops 2 (6 pts), match/switch 1 (2 pts) (nesting depth added 74). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dc9751a19a826ca73d0091b599e28402f638ca7af5c42efa089566f04bcc3f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ck_bridge.opCkInit (cognitive 131): op_ck_bridge.opCkInit has cognitive complexity 131 (threshold 15). Drivers by points: if/else 51 (62 pts), boolean chains 36, ternaries 12 (18 pts), loops 12 (14 pts), error handling 1 (nesting depth added 19). Of this number, 52 points are the body\u0027s own statements and 79 belong to 22 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"198ab6ab2b67ca15244096b84e694bede0f06646bc4a50ae66f9b0f0c5ccc0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::validation_fixes_apply::apply_validation_fixes (cognitive 124): op_orchestrator::validation_fixes_apply::apply_validation_fixes has cognitive complexity 124 (threshold 15). Drivers by points: if/else 47 (116 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"859396bd9c1ab00539b827118ca49186adcc7b6e159fce6b7c6aac288c779b86"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch (cognitive 122): op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch has cognitive complexity 122 (threshold 15). Drivers by points: if/else 42 (107 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 68). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ef831177665d2d481ea2d92c1a8c41a64f4428bbd3a1bcf4920e1b3019f0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::paint (cognitive 114): WidgetHostNative::paint has cognitive complexity 114 (threshold 15). Drivers by points: if/else 62 (89 pts), boolean chains 25 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"321cbf4f9b19f3dea2ab91ae1231051988241611ade11c25ec178f1cac4a953e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::parser::arguments_field (cognitive 113): op_mcp::parser::arguments_field has cognitive complexity 113 (threshold 15). Drivers by points: if/else 32 (78 pts), loops 9 (21 pts), boolean chains 12, match/switch 1 (2 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e0618f9ffd3984bd1a6022e7c4e43b1470b03c0b0d52d6b826a0e838625a58"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator::run (cognitive 113): Orchestrator::run has cognitive complexity 113 (threshold 15). Drivers by points: if/else 40 (74 pts), loops 8 (19 pts), match/switch 5 (15 pts), boolean chains 5 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_orchestrator.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a24831711bb187457a248bd28375b53885e9ea064ead7bead94e3b8adafaa"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::chat_http_server::run_opencode_turn (cognitive 98): op_host_services::chat_http_server::run_opencode_turn has cognitive complexity 98 (threshold 15). Drivers by points: if/else 32 (71 pts), match/switch 12 (18 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_http_server.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"449a3f8c3efcdbd6b6a162c4c68d05a0163ea3287a1e14e9fec38ac44b448c10"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_equalize_siblings::plan_family_repairs (cognitive 97): op_orchestrator::cleanup_equalize_siblings::plan_family_repairs has cognitive complexity 97 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 16 (31 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d86c3045f95a68bc29d0714c899ce7f9182e1bc5e0409a771f8baa62ba7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"VariablesPanel::hit_test (cognitive 96): VariablesPanel::hit_test has cognitive complexity 96 (threshold 15). Drivers by points: if/else 37 (84 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel/hit.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6bb5e74179973c38aa98a584110510c76f5549b5117863f26167840cf28e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::on_redraw_requested (cognitive 96): DesktopApp::on_redraw_requested has cognitive complexity 96 (threshold 15). Drivers by points: if/else 66 (82 pts), boolean chains 9, loops 2 (3 pts), match/switch 2 (nesting depth added 17). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/redraw.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce467844332253533a0878ce3823607058ef24a8c0f3200b94c52e1dad97153d"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::handle_key_pressed (cognitive 95): DesktopApp::handle_key_pressed has cognitive complexity 95 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 34, match/switch 6 (13 pts), loops 2 (8 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/keyboard_input.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3039b8505a7a40a57ff598989fd2a7ab36d4f6ff23decbefae2679664ecd3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_text (cognitive 92): WidgetHostNative::apply_text has cognitive complexity 92 (threshold 15). Drivers by points: if/else 56 (84 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7b325a1d9925f12cd3245bdcb9aa3b4b8fdacee22d800323d49427815d1994"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_overlay_cursor_move (cognitive 92): WidgetHost::apply_overlay_cursor_move has cognitive complexity 92 (threshold 15). Drivers by points: if/else 39 (75 pts), boolean chains 14, match/switch 1 (3 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa56daee089b23d3106b559291ab74ca7d47427120fe13e50517b23c512234e"}},{"ruleId":"D2","level":"warning","message":{"text":"opCkInit::measureParagraph (cognitive 92): opCkInit::measureParagraph has cognitive complexity 92 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 8 (20 pts), ternaries 6 (15 pts), boolean chains 8 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b684d40851bc154c64879072b10d03d6dc7ff60d8574a7a60b4a3db3a6ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_backspace (cognitive 91): WidgetHostNative::apply_backspace has cognitive complexity 91 (threshold 15). Drivers by points: if/else 58 (85 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_delete.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6df9dc252f2f08aafc96ef6521442ac324a6f7f16c6a1e4e1d175cd0348fa68"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::hit_test (cognitive 88): GitPanel::hit_test has cognitive complexity 88 (threshold 15). Drivers by points: if/else 45 (73 pts), loops 5 (7 pts), match/switch 2 (5 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":"crates/op-editor-ui/src/widgets/git_panel_hit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeccb8e628ba984c43b66c768c165cd1a19746619c3ea604b4de24b2a8b3c30"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerPanel::paint (cognitive 87): LayerPanel::paint has cognitive complexity 87 (threshold 15). Drivers by points: if/else 49 (77 pts), boolean chains 6, loops 2, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5a65ba8b39f2db4b5146449d95ce78cb3a6081677519680712c0d0e17d6bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::canvaskit::mount_keyboard::register_keyboard_listeners (cognitive 86): op_host_web::canvaskit::mount_keyboard::register_keyboard_listeners has cognitive complexity 86 (threshold 15). Drivers by points: if/else 24 (47 pts), boolean chains 38, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/mount_keyboard.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84380eccc4f842865cfecf5736db0eeed279264c13960f8c0e52aefc22a35ff"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabPanel::paint (cognitive 85): CollabPanel::paint has cognitive complexity 85 (threshold 15). Drivers by points: if/else 36 (72 pts), loops 5 (10 pts), boolean chains 2, match/switch 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"677407751aefa32d3520e525adbe664969a1326fc07985bcb0c5fec501fbc3be"}},{"ruleId":"D2","level":"warning","message":{"text":"SubprocessProvider::send_inner (cognitive 85): SubprocessProvider::send_inner has cognitive complexity 85 (threshold 15). Drivers by points: if/else 25 (49 pts), match/switch 15 (27 pts), boolean chains 7, loops 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7fd40579c44c80a8bf110d8651edcf0c10f91462690c6d2bed575301c390dc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::mcp_serve::sniff::walk_top_level (cognitive 84): op_host_services::mcp_serve::sniff::walk_top_level has cognitive complexity 84 (threshold 15). Drivers by points: if/else 24 (54 pts), loops 8 (18 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/sniff.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ae2cd71a42b32c4407b8c61089f513532bdb34734639fbf8c7432fa1b6f714"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit (cognitive 82): op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit has cognitive complexity 82 (threshold 15). Drivers by points: if/else 32 (67 pts), match/switch 8 (13 pts), boolean chains 2 (nesting depth added 40). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a8634b4eee156f48f056a066da9a07a6098f6b2110ae3cd1a7fe1f97cf1c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::paint_editor (cognitive 82): WidgetHost::paint_editor has cognitive complexity 82 (threshold 15). Drivers by points: if/else 48 (74 pts), boolean chains 5, match/switch 1 (3 pts) (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":"crates/op-host-web/src/widget_host/paint.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"632d5669032dfbe23ef8eb91ce36f2ca9e32f6bb41d44416f1978f90a43fdef9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_host::runtime::network::connection::drive_guest (cognitive 80): op_collab_host::runtime::network::connection::drive_guest has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (49 pts), match/switch 8 (25 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"652eb184a6fa8afd29c2850514936a11fac89b570238752480db03369061808f"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_floating_panel_tiers (cognitive 79): WidgetHostNative::cursor_move_floating_panel_tiers has cognitive complexity 79 (threshold 15). Drivers by points: if/else 35 (73 pts), boolean chains 6 (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":"crates/op-host-native/src/widget_host/cursor_move_panels.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbbc3e0977bd23b0af5dc28a302d8c76dd898bb3055a42b4543d8047179662a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::cmd_set_node_layout_prop (cognitive 78): EditorState::cmd_set_node_layout_prop has cognitive complexity 78 (threshold 15). Drivers by points: if/else 39 (75 pts), match/switch 2, boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_layout_prop.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece6cb9a50a1e9cf08e23f6e1f63ed1e9f04a3df2f642f4c2b9f48229f0aa50c"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_late_drag_tiers (cognitive 78): WidgetHostNative::cursor_move_late_drag_tiers has cognitive complexity 78 (threshold 15). Drivers by points: if/else 36 (68 pts), boolean chains 8, match/switch 1 (2 pts) (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":"crates/op-host-native/src/widget_host/cursor_move_drags.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0465adaea7d1a43079f886ebfd2240d94790f3dfa1ffa03e50887bb02cd047d5"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_press_inner (cognitive 78): WidgetHostNative::apply_press_inner has cognitive complexity 78 (threshold 15). Drivers by points: if/else 42 (62 pts), boolean chains 10, match/switch 3 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d676107951797dcebd3e662784db623570eb73e4e572359e676f10de336db111"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasViewport::paint (cognitive 76): CanvasViewport::paint has cognitive complexity 76 (threshold 15). Drivers by points: if/else 35 (63 pts), loops 3 (8 pts), boolean chains 5 (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":"crates/op-editor-ui/src/widgets/canvas_viewport.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e447b3d9436e07522d03e76704070ffa6b5ad3ba6b911798553daaa81214d3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::parser::parse_flat_object_body (cognitive 76): op_mcp::parser::parse_flat_object_body has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 7 (16 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"742d95111b2582e95a4394fd081035fe9de324ae46c7f5fc6fd07746f4a7d0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner (cognitive 75): op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (56 pts), loops 5 (11 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/openai.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"968bfa6edbcaa2291ab1886be39a3e8c6ce06f7f993ba86fb63578ed06997801"}},{"ruleId":"D2","level":"warning","message":{"text":"deckkit.audit_document (cognitive 75): deckkit.audit_document has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (53 pts), boolean chains 12, loops 5 (10 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/deckkit.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e9c0d7d451c68fded2864d482292c1a8eef00de4a0ad73b08b72d235b88796"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner (cognitive 73): op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (50 pts), loops 6 (15 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e29a4e51bfaa754f9419b60c3cc0e2de2033787866c0c885079d2b39227cff"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_send (cognitive 73): WidgetHostNative::apply_send has cognitive complexity 73 (threshold 15). Drivers by points: if/else 49 (66 pts), boolean chains 5, match/switch 1 (2 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":"crates/op-host-native/src/widget_host/keyboard_send.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e92d0a302858be4b7082ef690f10f6aa8617b716c8de3cd8de0f2893012506"}},{"ruleId":"D2","level":"warning","message":{"text":"op_pen_loader::payload::legacy_normalize::normalize_node_value (cognitive 73): op_pen_loader::payload::legacy_normalize::normalize_node_value has cognitive complexity 73 (threshold 15). Drivers by points: if/else 14 (60 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/payload/legacy_normalize.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9920727acdf9ab9a8efcf5901baa5bc5b43fab7eb6ce04459a8b7481f7c0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::variables_resolve::replace::replace_in_node (cognitive 72): op_editor_core::variables_resolve::replace::replace_in_node has cognitive complexity 72 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 5 (13 pts), match/switch 4 (13 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/variables_resolve/replace.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed173429d846fed14ca680bb42dac73fce681afd97ef2b38e04d9566928e65d9"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::drain_git_action (cognitive 71): DesktopApp::drain_git_action has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (45 pts), match/switch 6 (21 pts), boolean chains 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/git_host.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caa6f34e28cc5be1c94bc557dbe4e6620771f5d69bf346ebd555c64ad0eb67e"}},{"ruleId":"D2","level":"warning","message":{"text":"collectDesignEvidenceInPage::walkRules (cognitive 71): collectDesignEvidenceInPage::walkRules has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (56 pts), boolean chains 9, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb72f296fbe8fa0fcdbc73b0ed9ccfef7913c7018f4e0ac79d7eeff06a6f2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::on_left_press (cognitive 70): DesktopApp::on_left_press has cognitive complexity 70 (threshold 15). Drivers by points: if/else 32 (61 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13ce87300b9d4643933a6517596f4511a6d9faf02516ab0cd84689c90fc35cb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_smoke::main (cognitive 70): op_smoke::main has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (36 pts), match/switch 16 (30 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/main.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c42e5800928657860aa273cce6fe883f2e78711a5da4d02dcf6e3776f08f1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyPanel::paint (cognitive 68): PropertyPanel::paint has cognitive complexity 68 (threshold 15). Drivers by points: if/else 37 (54 pts), boolean chains 14 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/paint.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39bf73d6af497507df0ed11b1db0ea9a9b2411fec015f1b676cd1ced3aa2b9"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_escape (cognitive 68): WidgetHostNative::apply_escape has cognitive complexity 68 (threshold 15). Drivers by points: if/else 58 (64 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_escape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"12294b7c43f0f3e2081869bfd252c24885ec375625e15c8c87e1d50ccc46bd5d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web.__wbg_get_imports (cognitive 68): op_host_web.__wbg_get_imports has cognitive complexity 68 (threshold 15). Drivers by points: ternaries 49 (50 pts), error handling 18 (nesting depth added 1). Most of this is not in the body itself: 0 of the 68 points are its own statements and the rest belongs to 60 function literals inside it that branch (lines 69, 89, 95, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8469e6c680b99cdeaa81719e94faba8bd67e3d7049544265742f6e0f585432a8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_host::runtime::network::connection::drive_owner_peer (cognitive 67): op_collab_host::runtime::network::connection::drive_owner_peer has cognitive complexity 67 (threshold 15). Drivers by points: if/else 12 (40 pts), match/switch 7 (22 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"816b4b81d2e6d53328241f4b74e5a4f159546f598a34af291f51de2fd47d8a42"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_wheel_inner (cognitive 67): WidgetHostNative::apply_wheel_inner has cognitive complexity 67 (threshold 15). Drivers by points: if/else 40 (63 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/scroll.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff621aec1cc603ad936b4c8fc0854e06aa9bfda1886cbb3757cee1656b0e6cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_host::runtime::network::owner::run_inner (cognitive 66): op_collab_host::runtime::network::owner::run_inner has cognitive complexity 66 (threshold 15). Drivers by points: if/else 12 (36 pts), match/switch 11 (25 pts), loops 3 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/owner.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d21f14129af81836ad8c729c236365ae15b6460824d60799567a06d9c2eb11"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::variables_resolve::resolve_node_for_canvas (cognitive 66): op_editor_core::variables_resolve::resolve_node_for_canvas has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (51 pts), loops 5 (13 pts), match/switch 1 (2 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/variables_resolve.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d782ec252f5bac4a30dc0052d687be9087cb977615331bed8d640eb7dce1ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_property_overlay_tiers (cognitive 66): WidgetHostNative::cursor_move_property_overlay_tiers has cognitive complexity 66 (threshold 15). Drivers by points: if/else 36 (44 pts), boolean chains 22 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ab4fa3ec574650bcc8384bbb643858b7a414c591eae256b9c8a7de751f2ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::update_agent_settings_hover (cognitive 65): WidgetHostNative::update_agent_settings_hover has cognitive complexity 65 (threshold 15). Drivers by points: if/else 48, match/switch 5 (10 pts), boolean chains 7 (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":"crates/op-host-native/src/widget_host/geometry_settings_hover.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b3904f6bbc4a247b683b16863bb1120578d5d6e774fc39e828f12bb99512e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_row_fixes::collect_row_overfull_fixes_with_context (cognitive 65): op_orchestrator::geometry_row_fixes::collect_row_overfull_fixes_with_context has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (55 pts), boolean chains 9, loops 1 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad2d8f057b315a238c4875c1deaef30964430fda2392f7da7bc3e700ee64a23"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_canvas_server::connection::dispatch (cognitive 64): op_host_services::web_canvas_server::connection::dispatch has cognitive complexity 64 (threshold 15). Drivers by points: if/else 34 (39 pts), boolean chains 18, match/switch 4 (7 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c130ef3a875ec954c1fedae1d5376f3467694711cdac87db3fecbb124bbb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_input_layout::editable_input_rects (cognitive 63): op_editor_ui::widgets::property_panel_input_layout::editable_input_rects has cognitive complexity 63 (threshold 15). Drivers by points: if/else 32 (47 pts), loops 3 (7 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"70242c6e0b4b195918b4de8f48e682c97221aaf11dd18717c4ec9917faee8750"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker (cognitive 62): op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker has cognitive complexity 62 (threshold 15). Drivers by points: if/else 34 (49 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_layout.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"681fb1b172cfbee47af8cb314ec5c55f14875f6859dcdcf2022fb5bd7827a956"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::dispatch_git_panel_press (cognitive 62): WidgetHostNative::dispatch_git_panel_press has cognitive complexity 62 (threshold 15). Drivers by points: if/else 31 (58 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/git_press.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5391d591fb7c18fca7bf171ffbda727ff33ad72ac6738568ad2cd89a670bd4e1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard (cognitive 60): op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard has cognitive complexity 60 (threshold 15). Drivers by points: if/else 30 (57 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"901002457700a4742e598f30c5ae8ba293de8d06e6548af7fc86c059faa8372e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript::paint_transcript_with_selection (cognitive 59): op_editor_ui::widgets::ai_chat_transcript::paint_transcript_with_selection has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 5 (12 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f4b14ef2e7fb11356909c89acb1065a1507fcb6309a25d6e760ff7f358d12"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_hit::transcript_hit (cognitive 58): op_editor_ui::widgets::ai_chat_transcript_hit::transcript_hit has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 6 (13 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_hit.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"079af220f8c9b4fa93cc3b03f4b0238dd4d111724b82ca6d8f1571bbe767cb3e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_diagnostics_collect::collect_diagnostics_with_context (cognitive 58): op_orchestrator::geometry_diagnostics_collect::collect_diagnostics_with_context has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 7, loops 3 (6 pts), match/switch 1 (5 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_diagnostics_collect.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c1fb0070675073c78d0717a18e3d31b7440ac599341a83e10754c952ed1e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::mcp_integrations_dsh::update_dsh_patch_config (cognitive 57): op_host_desktop::mcp_integrations_dsh::update_dsh_patch_config has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 3 (10 pts), match/switch 3 (5 pts), boolean chains 3 (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":"crates/op-host-desktop/src/mcp_integrations_dsh.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad96a71191ba46ab23e354476d5b9e988fb08cfb8766d2fb7bcab17886e49a96"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::commit_property_edit_inner (cognitive 56): EditorState::commit_property_edit_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (42 pts), match/switch 6 (11 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a293d5baa8e0736a5faf184fddb22a6a186d04161fc18ddc63803c6b813e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::home_surface_paint_panels::paint_composer (cognitive 56): op_editor_ui::widgets::home_surface_paint_panels::paint_composer has cognitive complexity 56 (threshold 15). Drivers by points: if/else 32 (47 pts), loops 4 (7 pts), boolean chains 2 (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":"crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc52a012a4b6e7522d640dc99af8658d4b7a410825ba8f6c78dc7829642fe46"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript::build_item (cognitive 56): op_editor_ui::widgets::ai_chat_transcript::build_item has cognitive complexity 56 (threshold 15). Drivers by points: if/else 35 (39 pts), boolean chains 12, loops 3 (5 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":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"de346c4eebe0d6c1139381712e47272c879b5974a5f11315a43a2597af13ebec"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceSurface::hit_test_layout (cognitive 55): WorkspaceSurface::hit_test_layout has cognitive complexity 55 (threshold 15). Drivers by points: if/else 25 (50 pts), loops 2 (5 pts) (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":"crates/op-editor-ui/src/widgets/workspace_surface.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d27ae6a4d20aa30eaf3165c1bc592665eb967a4f3c73883ea2f56b75f401a1"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_hint (cognitive 55): WidgetHostNative::cursor_hint has cognitive complexity 55 (threshold 15). Drivers by points: if/else 33 (46 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_hint.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dd33bc5050fe73246006a86d4e641e03b9bc3d037bd5ebcbc61383a328251a"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_pan_gesture (cognitive 55): WidgetHostNative::apply_pan_gesture has cognitive complexity 55 (threshold 15). Drivers by points: if/else 35 (51 pts), boolean chains 4 (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":"crates/op-host-native/src/widget_host/scroll_pan.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72e5bc02b41cb5e7e78722aa637bf2144814a4633d3d82ba7a4986c2af7b65c"}},{"ruleId":"D2","level":"warning","message":{"text":"createWebImageCaches (cognitive 55): createWebImageCaches has cognitive complexity 55 (threshold 15). Drivers by points: if/else 35 (39 pts), boolean chains 9, error handling 5, loops 2 (nesting depth added 4). Most of this is not in the body itself: 0 of the 55 points are its own statements and the rest belongs to 15 function items inside it that branch (installRasterizedSvg, thumbnailImage, drawThumbnailCover, \u2026). 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":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2d3e76b4909919d55602b3c8a40fe069c87c43cd4ad901bec50fbeb2beb543"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserState::handle_action (cognitive 53): BrowserState::handle_action has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (42 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/discovery_bonjour_browser.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8f927bb5d6efa9be02085c692c84ae1d3ebd4ebd629a63e9a88d3ae5bf1ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_host_core::codegen_session::run_pipeline_with_model_and_cancel_token (cognitive 53): op_editor_host_core::codegen_session::run_pipeline_with_model_and_cancel_token has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 4 (15 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/codegen_session.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee67539c6f01b4988a5625b07be64ca94e3a078659e12372253b7032447049"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_post_pass::contrast::fix_button_foreground_contrast (cognitive 53): op_orchestrator::role_post_pass::contrast::fix_button_foreground_contrast has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (47 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/contrast.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fd0c32b2ce198d24f0aa9c756cdc7f4e058cf81baefd3b1bbbcec6dac0f9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"opCkInit::drawImageWithOptions (cognitive 53): opCkInit::drawImageWithOptions has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 6 (13 pts), boolean chains 9, loops 2 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21ee56bbba51cbe408780095410d72945f46a4762001fbd4ed2be1d63436350"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::fingerprint::score (cognitive 52): op_figma::instance::fingerprint::score has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29 (45 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/fingerprint.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a89ce9a1bb82f0a3f4f3f36c9075845349896e609278a6bff0196f643ef3cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_ime_commit (cognitive 52): WidgetHostNative::apply_ime_commit has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (35 pts), loops 5 (9 pts), boolean chains 8 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ime.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"82591f9b3e0a4852c686e8427b69bb7b65267710a2b7e831c2d2578b82a59edc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::canvaskit::mount::mount_ck (cognitive 52): op_host_web::canvaskit::mount::mount_ck has cognitive complexity 52 (threshold 15). Drivers by points: if/else 38 (48 pts), match/switch 3, 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":"crates/op-host-web/src/canvaskit/mount.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"07995b53aa1446785640e1addfaf957e1935f63ea863939684e7730dd9c83c07"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::script_runner::repair_truncated_script (cognitive 52): op_mcp::script_runner::repair_truncated_script has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 3 (8 pts), boolean chains 4, loops 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d26c3b715d395a5c28816e965a9ca035f23a69834d070aeb993e7dd845d4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::subtask_completeness::expected_item_count (cognitive 52): op_orchestrator::subtask_completeness::expected_item_count has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (43 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/subtask_completeness.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"64de0dda08ce373b32a371a1d781d502098ce73d355e0ccec09dd6eb7194599d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke (cognitive 51): op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke has cognitive complexity 51 (threshold 15). Drivers by points: if/else 30 (43 pts), boolean chains 8 (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":"crates/op-editor-ui/src/widgets/canvas_viewport_image.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef2dd3efa0642e328bc89bd24306999d37c5a785412c18573169061470ae554"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_release_with_viewport_inner (cognitive 51): WidgetHostNative::apply_release_with_viewport_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 41 (47 pts), boolean chains 4 (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":"crates/op-host-native/src/widget_host/release.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e0f7c8c05d27c6d7d4d09e46eceaefa649adaa4bbb484998296a6748e66f21"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::update_agent_settings_hover (cognitive 50): WidgetHost::update_agent_settings_hover has cognitive complexity 50 (threshold 15). Drivers by points: if/else 32, match/switch 6 (11 pts), boolean chains 7 (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":"crates/op-host-web/src/widget_host/agent_settings_hover.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe51228fc2d0345ecaa7e62f6bbb70ccf9b33daad2aaf51d227aa8fe4a64e69"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_margin::finish_children (cognitive 50): op_html::mapper_margin::finish_children has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 6 (7 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_margin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1fa2d79586367cd24d27565720971b2e29993d396e97e1bdf992a857f9ff9f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::spacing_repair::strip_in_value (cognitive 49): op_orchestrator::spacing_repair::strip_in_value has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 12, loops 2 (5 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/spacing_repair.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a11cba3d0071858b4d159145799f05f78f2a2cbcc3c3ec6723dc692ce062ac"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::loop_finalize_record::record_same_id_shallow_patches (cognitive 49): op_orchestrator::loop_finalize_record::record_same_id_shallow_patches has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 7 (9 pts), boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize_record.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52b97f35fb1f96e2bb71c0414ea68987daa68f0668ca5bf6dab8f5a564c9d18"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-extractor.vectorizeSvg (cognitive 49): snapshot-extractor.vectorizeSvg has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 10, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e12b0ce8852a53cb70ddcd5a55057bc1e328b267e53360b39d433b8599e007"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::vectorizeSvg (cognitive 49): (anonymous)::vectorizeSvg has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 10, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3514c763c38283bc3f95b6f87de19494666fcb5bb3b0f578ec2fda6ee069bc6f"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabPanel::hit_test (cognitive 47): CollabPanel::hit_test has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel_interaction.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ce91b53386ee6fe0259f7f58b4b8ccf94b2dd48f86821108239e1021f632a2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout (cognitive 47): op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (39 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"750d9100dfb736ccc5d653ed9f06927cb8ff9e28aa75839829d5e5281dee6569"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_layer_bounds::subtree_visual_bounds (cognitive 47): op_editor_ui::widgets::canvas_viewport_layer_bounds::subtree_visual_bounds has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_layer_bounds.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fb5d3b65f1f9ebc00421a2356462c1d34ad018c9fb42a02b0fb12b328a9e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::apply::apply_to_node (cognitive 47): op_figma::instance::apply::apply_to_node has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/apply.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4d102e0658d9fa6f1a1683041a7a0525691793eb53f0074c3ba933240c2249"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::resumed (cognitive 47): DesktopApp::resumed has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 3, match/switch 3 (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":"crates/op-host-desktop/src/app_handler.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e93fdaf5f91569acf49199eba8e4584ccc813c071d803bb1b3e9f726f4063"}},{"ruleId":"D2","level":"warning","message":{"text":"freshcheck.audit (cognitive 47): freshcheck.audit has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 5, ternaries 3 (5 pts), loops 3 (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":"templates/step0/_generators/qa/freshcheck.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"217e45f3e928dfdee9f548047fff7c7188af54bbd6d28a22a201220a002260d9"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::paint (cognitive 46): GitPanel::paint has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (36 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel/paint.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae173067ad107ae2f56ec7b518694f0b1fc6b9bd1ddcc31b2727d787db64f38e"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeSurface::hit_test (cognitive 46): HomeSurface::hit_test has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (35 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2dc59552cb6bc9e45bd6969ef7b8995997f3f2dec82e0c4e7dcccc7797cf0e"}},{"ruleId":"D2","level":"warning","message":{"text":"SceneTemplatePanel::hit_test (cognitive 46): SceneTemplatePanel::hit_test has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_hit.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88e4fd7d48830c9a3017d4c61834bee99b3a2adc50a29054680db581462c5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_modal_tiers (cognitive 46): WidgetHostNative::cursor_move_modal_tiers has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_modals.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"642df0ff09bb24e6107d22d6c6f83a5b2bb6b58042d5351c128450602584476a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web.__wbg_get_imports (cognitive 46): op_host_web.__wbg_get_imports has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 30, error handling 16. Most of this is not in the body itself: 0 of the 46 points are its own statements and the rest belongs to 40 function literals inside it that branch (lines 49, 55, 783, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8b91a3810116cb4cb517190bc5e1abd95afaa6c122ac8a91fa47f118dcf1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_code_complete::syntax_tokens (cognitive 45): op_editor_ui::widgets::property_panel_code_complete::syntax_tokens has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_code_complete.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3a21f15e0f0ce747e5ad7bf80d0310b0350c24fdd3b845463a964915b50af"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth (cognitive 45): op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_ui.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6210de5991f9367583d580f13edbb6190f28e1647662dc852b31c38f572bb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::design_session_workers::finish_design_success (cognitive 45): op_host_desktop::design_session_workers::finish_design_success has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session_workers.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"180603c481709374969b620868bf5101c5879c7045da9c67d17a8ee8e6bd5d27"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::enforce_slide_padding_floor (cognitive 45): op_orchestrator::cleanup_slide_padding::enforce_slide_padding_floor has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 7, match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5cd406513b50b3e96974dbd37ef6a5234f2761d89243014e3eba6307fd3dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_pen_loader::payload::legacy_normalize::auto_layout_order_evidence (cognitive 45): op_pen_loader::payload::legacy_normalize::auto_layout_order_evidence has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (34 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/payload/legacy_normalize.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa333593d21ddfcd82531d9c5d8afe9e31efa0da607e7132007f26cd8829d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::spacing::walk_edge_section_padding (cognitive 44): op_design_lint::detectors::spacing::walk_edge_section_padding has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (11 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec46d56078f4ac10bce6c1d7f3d7bc0afc4a62d9445a0b05f0a97f2f9f3a8348"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_form::paint_field (cognitive 44): op_editor_ui::widgets::agent_settings_builtin_form::paint_field has cognitive complexity 44 (threshold 15). Drivers by points: if/else 31 (37 pts), match/switch 3 (4 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":"crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f23d0ad879c2e6abe4622ac02dbf1b02086a81e443f4b93d552a45869e5cb33"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_dispatch::apply_property_action (cognitive 44): op_editor_ui::widgets::property_panel_dispatch::apply_property_action has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (38 pts), match/switch 3 (6 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_dispatch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d73db4d0fe814b2f747751d9966f844c0d17f0c2e30c548e2273c32d050f534"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_instance::paint_component_block (cognitive 44): op_editor_ui::widgets::property_panel_instance::paint_component_block has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_instance.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b896678ec23489b63ce93e4ac740ef198757087e55dabb37a160eb6e6841126"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_text::paint_text_node (cognitive 44): op_editor_ui::widgets::canvas_viewport_text::paint_text_node has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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":"crates/op-editor-ui/src/widgets/canvas_viewport_text.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"614c46b408091d5865553bd49d2b5eae4ed1d27dbaa7b1bf0ea20a36dd8e8ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_release (cognitive 44): WidgetHostNative::apply_release has cognitive complexity 44 (threshold 15). Drivers by points: if/else 34 (40 pts), boolean chains 4 (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":"crates/op-host-native/src/widget_host/release.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30bb29d5657791002e74d4ec9cb1a5b73f9aa4e495fe4e214f5902860458fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::script_runner::balance_brackets (cognitive 44): op_mcp::script_runner::balance_brackets has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 6 (14 pts), match/switch 1 (2 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":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c9fad440aceefd28b5569c3d86c4a0fbb1dd3e3395c4d5dbf68b84534c106"}},{"ruleId":"D2","level":"warning","message":{"text":"TopBar::paint_chrome (cognitive 43): TopBar::paint_chrome has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_paint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fed81c775cf30b0a72b529dbd95d688c0f8bb29ed4c0cd16beac414e6b38f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_delete (cognitive 43): WidgetHostNative::apply_delete has cognitive complexity 43 (threshold 15). Drivers by points: if/else 30 (40 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_delete.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9135daa71d9ae4cd9d408970f4bc586b9a6dadbee28153f72f9c41ea0fea068e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_opmerge::merge_core (cognitive 43): op_opmerge::merge_core has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (7 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-opmerge/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d96f5a7102da346ee73b3c1c5d399fb2be7ad2254d41f662846b2a872715802"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_overflow_fixes::collect_text_overflow_fixes_with_context (cognitive 43): op_orchestrator::geometry_overflow_fixes::collect_text_overflow_fixes_with_context has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (33 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe388abe1488359e5d8c734040e1b23fbaf4ded4d08928c2a35d92a739d46e1"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyPanel::hit_test_action_logical (cognitive 42): PropertyPanel::hit_test_action_logical has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (32 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/hit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b640a27b2d18bb641aac99723923020bc262ea08dab0c181374767e760909721"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_model_menu::paint_model_menu (cognitive 42): op_editor_ui::widgets::agent_settings_builtin_model_menu::paint_model_menu has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"294268a742730f09a10285a0089c160ae4b1ce2bcfd4beb55831097c6d6a77d6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::clipboard::parse_clipboard_html_styles (cognitive 42): op_figma::clipboard::parse_clipboard_html_styles has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (34 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/clipboard.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"45970e7d0da3dc7e6ef31a07279f981d9a615f38540a3744cd5687b63239e320"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_status_align_picker_tiers (cognitive 42): WidgetHostNative::cursor_move_status_align_picker_tiers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a633bb5dd7f11a8fdec029b02fea42fc6bdba5f448e9ba2811dedd7d3d0059dc"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_backspace (cognitive 42): WidgetHost::apply_backspace has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (40 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":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f208fda6f9f581da310084e7ad2b04071a697c0e79c0a5ca8f9218cd39c2fb43"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::script_runner_dotted_keys::repair_dotted_object_keys (cognitive 42): op_mcp::script_runner_dotted_keys::repair_dotted_object_keys has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner_dotted_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2442abae355469923b7b79042735c3d7b220ffa3a7325c16e11013cc5995ce64"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes (cognitive 42): op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (33 pts), boolean chains 6, match/switch 2 (3 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":"crates/op-orchestrator/src/prompt_subagent.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2ce4ec24d1af14ab84390574232b80cfc54e6ac09d60001f52f53cfd99ff9a"}},{"ruleId":"D2","level":"warning","message":{"text":"OpSurfaceViewEditorTouch.editorTouch (cognitive 42): OpSurfaceViewEditorTouch.editorTouch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 3, match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceViewEditorTouch.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e9a47c5811e2e4f61ba2e70607c27b02da711cb5bb6cf1ad76a6d8d887010e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::typography::first_solid_color (cognitive 41): op_design_lint::detectors::typography::first_solid_color has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (34 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/typography.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8893af0401e7884fc5e122507e0d881a6cf5c877050566111f66d61b7edce0c6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::path_data::parse_path_d (cognitive 41): op_editor_core::svg_import::path_data::parse_path_d has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 4 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2afb6ba67376d5ef133d03b99de44467f3e79264d62438afb4d14d0b9f711e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::node_mapper::style_references::resolve_on_node (cognitive 41): op_figma::node_mapper::style_references::resolve_on_node has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/node_mapper/style_references.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a625ae93f4a4741b2fb6812a1aae6923955daba940932748f00dc97b627876"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_node_drag_cursor_move (cognitive 41): WidgetHostNative::apply_node_drag_cursor_move has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"595128a97dcf856892e2b49070da778213f673491eade9973956d62307f61934"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::mcp_serve::read_http_request (cognitive 41): op_host_services::mcp_serve::read_http_request has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 7, match/switch 3 (4 pts), loops 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":"crates/op-host-services/src/mcp_serve.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"007bd04746beb7154671f964ce015d78666a20bb4e554b7b5d55631a8b94ecbc"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::update_dropdown_hover (cognitive 41): WidgetHost::update_dropdown_hover has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (34 pts), match/switch 3 (6 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":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac5738be11fa365cf8a13396724f0d194f70ff99782f48dd1a9408f0a97ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::dom_io::handle_paste_event (cognitive 41): op_host_web::dom_io::handle_paste_event has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3467217c81c32e6723f4b7072cdacb90fcd6f1af2d809dd338c5f6f5192c8d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_opmerge::apply_overrides (cognitive 41): op_opmerge::apply_overrides has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 4 (14 pts), match/switch 2 (3 pts) (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-opmerge/src/lib.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"194c2ae5ffa34b92e85be1ce1ff373ea701c130512ea6a7f5f2ea92311b0083f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density (cognitive 40): op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (32 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfadb2bedb355bd97c848162b7cc1cb2d72d722a71b5fbd4b2aa223bcf5d2bb"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_escape (cognitive 40): WidgetHost::apply_escape has cognitive complexity 40 (threshold 15). Drivers by points: if/else 39, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_escape.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5432dca3553669b8a916e40b24d989d5804b74ae1388060319b66ffa57337ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_post_pass::micro_surface_radius::round_missing_semantic_micro_surfaces (cognitive 40): op_orchestrator::role_post_pass::micro_surface_radius::round_missing_semantic_micro_surfaces has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 14, loops 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/micro_surface_radius.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"766eef36f65edd2366d838616c2a71d4ef52a28636325711aedf4dbfcca90c17"}},{"ruleId":"D2","level":"warning","message":{"text":"op_preview_core::binding_overlay_apply::apply_value (cognitive 40): op_preview_core::binding_overlay_apply::apply_value has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (39 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":"crates/op-preview-core/src/binding_overlay_apply.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"481582d3d0cca40f1387eb08f5d869d91966b835e7584f52921cb3e6434093e0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_preview_core::binding_sites::collect_binding_sites_under (cognitive 40): op_preview_core::binding_sites::collect_binding_sites_under has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/binding_sites.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2345bd7e08b1eae3a853fcaffdf3f8a922c9e611961e528088a0954b61fb8e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_relay_server::connection::relay_paired (cognitive 39): op_collab_relay_server::connection::relay_paired has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5369f0dc96eab93c5bc9ab35469b33137cad93e6eae1a370e38c105ba1fa524"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::scale_command_path (cognitive 39): op_figma::vector_decoder::scale_command_path has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (9 pts), boolean chains 8 (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":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df78f6c62fa6df1da371a73704532ba7787035fb2b7b8bb7264a805433ecc1a"}},{"ruleId":"D2","level":"warning","message":{"text":"GitRepo::candidate_op_files (cognitive 39): GitRepo::candidate_op_files has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 2 (7 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-git/src/candidates.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fb0037da56fa26c7e8d1eb493661dcd4116c5353d7f9f5deda6535cbd8e9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_delete (cognitive 39): WidgetHost::apply_delete has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05fd915982dd8fe54444291613a69027782d5ca8a047816c8e874c7ec8d5731"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::declarations::expand_background (cognitive 39): op_html::css::declarations::expand_background has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b3a73e7bf7659eb760f98da3ff46526f934182eb62631ef122d1a277f37afa"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan_normalize::normalize (cognitive 39): op_orchestrator::plan_normalize::normalize has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 5 (10 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_normalize.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c5334e2a60d5c531aff80240c4a68e5071e8f85e1760aa61580c19d395767f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::frontmatter::entries (cognitive 38): op_ai_skills::frontmatter::entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (14 pts), match/switch 1 (6 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/frontmatter.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6343c038ce21d3881b9556abe2d7d871566b0e9d67ee35b82634116a714d637"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::press_flow::apply_layer_panel_click (cognitive 38): op_editor_ui::widgets::press_flow::apply_layer_panel_click has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 3 (6 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":"crates/op-editor-ui/src/widgets/press_flow.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd355610a6c0455778e731b6a09794052b5ff235ea4956fce6a73ab61f39721"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_input_layout::push_fill_action_rects (cognitive 38): op_editor_ui::widgets::property_panel_input_layout::push_fill_action_rects has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (6 pts), match/switch 1 (2 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":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed151b5500c1a8edf9c5aa6839a7f68a947ad5e0d7c03c4aa1ed91814d3ee4f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::chat_claude::map_message (cognitive 38): op_host_services::chat_claude::map_message has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 3 (7 pts), loops 1 (2 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":"crates/op-host-services/src/chat_claude.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"312b3ec6e52dac07a3856f92427cb65539ec096822820dc7e2f212a36b025dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::text::normalize_segments (cognitive 38): op_html::text::normalize_segments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/text.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d7a17c9071257653765e488b58051fa5a905c23000cdbd42c7f75e6b63ffff"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_program::explicitly_sized_append_lines (cognitive 38): op_mcp::batch_program::explicitly_sized_append_lines has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_program.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"59282442527826131ed2c29538cdbffe438a3b955d325186eef66f823658cf4e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::mobile_content_rail::collect_repairs (cognitive 38): op_orchestrator::mobile_content_rail::collect_repairs has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_content_rail.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d6326b677a0ba8c1c82f5ff680ac424a804c3630423147741ba26b2814bcba"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiToolCollector::handle (cognitive 37): OpenAiToolCollector::handle has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 1 (3 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai/src/chat_tool_sse.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e2b780599d9bfc34ea45352ac772cd9cd3415f21d59ab37391ee5652c4b93b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_parts::paint_preset_menu (cognitive 37): op_editor_ui::widgets::agent_settings_builtin_parts::paint_preset_menu has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_parts.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf317cd978efdae70c5b47cfdcad86b55564a427592896cb4ba1c9823fa26fed"}},{"ruleId":"D2","level":"warning","message":{"text":"op_image_enrich::net::providers::catalog::fetch_openverse_json (cognitive 37): op_image_enrich::net::providers::catalog::fetch_openverse_json has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 2, match/switch 1 (2 pts), loops 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":"crates/op-image-enrich/src/net/providers/catalog.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6572fa9e6a134a86cb1eb94974d7f201e3b799b38be5efc98eb88874a5fe61c8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::loop_finalize::fix_theme_variable_polarity (cognitive 37): op_orchestrator::loop_finalize::fix_theme_variable_polarity has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (33 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6336ff42acd695f92b28251fcbec2e1020fc6c34025b8a402cdba0c0c470cb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_overflow_fixes::collect_frame_overflow_fixes_with_context (cognitive 37): op_orchestrator::geometry_overflow_fixes::collect_frame_overflow_fixes_with_context has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (27 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e08ef0a99bb4cae5a4d34ac96eccbe44f6bb1b63d982926c0c2863c119323d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan_coverage::required_sections (cognitive 37): op_orchestrator::plan_coverage::required_sections has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 5 (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":"crates/op-orchestrator/src/plan_coverage.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3fb1b50223b01670f8e628b6143701ca62eae164f07bb7256ca748d7f530a5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::scale::scale_svg_path (cognitive 36): op_editor_core::svg_import::scale::scale_svg_path has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/scale.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ec96ee02e37d38db0f027d94350793e5c2f49802791f98198395c74e4dffe1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::assemble_region_paths (cognitive 36): op_figma::vector_decoder::assemble_region_paths has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (6 pts), boolean chains 3 (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":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"2157aff487122647f9f250b0fd13be4ee9df7410471ff008bd4c2c6707db9637"}},{"ruleId":"D2","level":"warning","message":{"text":"cjkcheck.main (cognitive 36): cjkcheck.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (8 pts), boolean chains 6, ternaries 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/qa/cjkcheck.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"536200868d3ed6f96659f7a819480b578660dd6987d1123281d850d355fe575c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::siblings::walk_sibling_inconsistencies (cognitive 35): op_design_lint::detectors::siblings::walk_sibling_inconsistencies has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 6 (13 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":"crates/op-design-lint/src/detectors/siblings.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c414afc8c58399634e472840da8460d1156a0c752f7b348038c409c15c3b980"}},{"ruleId":"D2","level":"warning","message":{"text":"AIChatPlaceholder::paint (cognitive 35): AIChatPlaceholder::paint has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 6 (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":"crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb3efa704af4d6059388d4f53f2c0fa08672105088114319beff02ce25f63f2"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabPanel::hover_at (cognitive 35): CollabPanel::hover_at has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel_interaction.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35b3deb087288b39bad407f5440d2902e19185ba015e32ab602370bf5e2b7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_ffi::op_pointer (cognitive 35): op_engine_ffi::op_pointer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/lib.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"01019a1b28d1212c925f641cca6bfb9d49c031373f9c6d29deb2b08fa0dd6ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::persistence::run_action (cognitive 35): op_host_desktop::persistence::run_action has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 5 (9 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/persistence.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b289dd819d9d8ea1455d772c09b492698b50d12500ccd3032094748d138eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_ime_preedit (cognitive 35): WidgetHostNative::apply_ime_preedit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 7 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ime.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a671e35de6f2a2b1908c91f746197e92a790004cabc785097e24d469c2a082e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_menu_modal_tiers (cognitive 35): WidgetHostNative::press_menu_modal_tiers has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 3 (8 pts), boolean chains 7 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b338f67263b9f194e696b351fd9cf070de9c9e84904dd83c210e28ffe83eec1e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::srcset::parse_srcset (cognitive 35): op_html::srcset::parse_srcset has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (8 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/srcset.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2851dfabde15d5a91f5ab85b6ac55f0cca1f065e4212f7f0df253b63f49c5e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::script_runner::escape_raw_newlines_in_quoted_strings (cognitive 35): op_mcp::script_runner::escape_raw_newlines_in_quoted_strings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (5 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":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5666ea48554cc1a77bd1aaf6d940472eb4ade4fd795ba4c97c1fcbc078cc8bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::radial_repair::radial_stack_repair (cognitive 35): op_orchestrator::radial_repair::radial_stack_repair has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 9, loops 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":"crates/op-orchestrator/src/radial_repair.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71823b034a63ba5e4f494854d4056315f10854e04fc42010fc5fabe3936ed74"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::siblings::walk_mixed_padding (cognitive 34): op_design_lint::detectors::siblings::walk_mixed_padding has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (9 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/siblings.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f41c1504b8d934750bb993d066c3f675501b0a4ff68d037ff778f6101529e98"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::structural_quality::walk_redundant_wrappers (cognitive 34): op_design_lint::detectors::structural_quality::walk_redundant_wrappers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (31 pts), boolean chains 2, loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/structural_quality.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a4c9d257437c02846de819713da2df85780aa6a249636f4b6ce5c3d70db4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::assignment::seed_assignments_from_instances::collect_geom (cognitive 34): op_figma::instance::assignment::seed_assignments_from_instances::collect_geom has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (9 pts), boolean chains 4 (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. This shape REPEATS in the file: 2 other methods here (op_figma::instance::assignment::seed_assignments_from_instances, op_figma::instance::assignment::seed_assignments_from_instances::collect) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0097612c6ed50b717bc1558cb9ad6bf69305b18208dfe29a91853d76855ae889"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::boolean_fallback::apply_result_paint_to_artwork (cognitive 34): op_figma::boolean_fallback::apply_result_paint_to_artwork has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (15 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/boolean_fallback.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b294adcaeb0950e0d2df8d3715d46e9f419e93eb2a57f9c2435e04b18c6d660"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::ai_proxy::proxy_builtin_for_identity (cognitive 34): op_host_services::ai_proxy::proxy_builtin_for_identity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 6, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/ai_proxy.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"707742701430b8989b380bab8d88a4a89bfc7a316cd2723dc5e9868933a2ca0c"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_text (cognitive 34): WidgetHost::apply_text has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26 (34 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d1c13176ba951fc7551afc449c8c4be7b7399e47865736e1b514e897eaf0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::codegen_plan_store::validate_plan (cognitive 34): op_mcp::codegen_plan_store::validate_plan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 8 (16 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":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba20fe54f973452c573a6893f3b95f3d954b3efa5380534131df283564f34f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::siblings::walk_mixed_corner_radius (cognitive 33): op_design_lint::detectors::siblings::walk_mixed_corner_radius has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/siblings.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8fb8c37245ac953eba7221d79023953d60fffe4cc05aa8a315a5532a39fb12"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::host_variables_commit::commit_row_draft (cognitive 33): op_editor_core::host_variables_commit::commit_row_draft has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 1, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_variables_commit.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2b72c58256a4c6c23165baf01f912c4b9b1411acf84cd0cfd1f258664ea5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::host_settings_commit::commit_settings_focus (cognitive 33): op_editor_core::host_settings_commit::commit_settings_focus has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 4 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_settings_commit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a2399ab543fb1ba2fc36f5b47d3da1998416b9c7b1258051f620b1f03ef2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_commit::commit_property_focus (cognitive 33): op_editor_ui::widgets::property_panel_commit::commit_property_focus has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_commit.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b992fa82acea0d81d5586d78adbe09c379ee3eaf2f75634433f69aabcd54c4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::home_surface_layout::layout_for_scrolled (cognitive 33): op_editor_ui::widgets::home_surface_layout::layout_for_scrolled has cognitive complexity 33 (threshold 15). Drivers by points: if/else 25 (26 pts), loops 5, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_layout.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6931a10bc19220b01ec71932766ac4a399fcba1dd0353f67cba6077d492714"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::chat_session::execute_tool_requests (cognitive 33): op_host_desktop::chat_session::execute_tool_requests has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 1, loops 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":"crates/op-host-desktop/src/chat_session.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e21998cbe198d6d3488a2c61e05f8f03cb8cce88649f5d2496239b91b6b2d44"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_mobile_more_sheet_tier (cognitive 33): WidgetHostNative::press_mobile_more_sheet_tier has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6ed92a420fabcdbe26bfdd3e7f1f4b73662008b4799993a6b48b0d3917b907"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes (cognitive 33): op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 11 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6703019e6e0f2f3eec05fc327def5eb996f6aef363783a73034e9a92bc1d563e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_section_margins::unify_transparent_section_margins (cognitive 33): op_orchestrator::cleanup_section_margins::unify_transparent_section_margins has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_section_margins.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9e6fe7695a080361d0718199959d5d7011076255f047a763aa0df69bad2c13"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chrome_extension_core::design_md_validate::is_valid (cognitive 32): op_chrome_extension_core::design_md_validate::is_valid has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 11, loops 2, match/switch 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46cc20c914b0516d523c4055aa3663a673bc0030fe2665e2ec888319d99ef20"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::active_text_input (cognitive 32): EditorState::active_text_input has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (24 pts), boolean chains 4, match/switch 2 (4 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_input_focus.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd6eb65112656a278be3f66b5156339255c817b2ed64e136a3bf26a6bbb649"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin_form::paint_identity (cognitive 32): op_editor_ui::widgets::agent_settings_builtin_form::paint_identity has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27 (30 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff24ff1142154850e8727b2961ced87b8b842843f9f26adca130d5bb934416"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::cli_model_discovery::parse_grok_models (cognitive 32): op_host_services::cli_model_discovery::parse_grok_models has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/cli_model_discovery.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"614a7451af2d42144275d6cda17fe5029ada9c7717e850464990b00cfc0adbae"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::design_md_evidence::evidence_provenance (cognitive 32): op_host_services::design_md_evidence::evidence_provenance has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 6 (7 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bede6ae54aa4c4c0a7cd73066c36a1b245b1a615b02157ad07d5b7f0064230e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_visual::map_gradient (cognitive 32): op_html::mapper_visual::map_gradient has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (31 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"634445e4e297e5f12381aa4142facdb5b1c94f7e88a48db7a9476f30be0b3ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::hero_bleed::enforce (cognitive 32): op_orchestrator::hero_bleed::enforce has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 1 (4 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":"crates/op-orchestrator/src/hero_bleed.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"00848883bce01802229da62dc1168931745f31691f72c9ce4665171944ff00d6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_preview_core::motion::collect_load_warnings (cognitive 32): op_preview_core::motion::collect_load_warnings has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (16 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"054a57f2a4475b3e95b7c810d7ecab6128810acca483804f078fb070d29b0c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"design-evidence.sanitizeDesignEvidence (cognitive 32): design-evidence.sanitizeDesignEvidence has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 12, ternaries 11 (12 pts), if/else 4 (7 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 10 of the 32 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 213, 146, 180, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-evidence.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"529122329fee824111a284547da7e7d767e39dae18aa702a8a062deb1d54b943"}},{"ruleId":"D2","level":"warning","message":{"text":"generateDesignMd (cognitive 32): generateDesignMd has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 6, other 3, ternaries 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function literal 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":"packages/op-chrome-extension/client.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da2eca0e5bc321212cbee52284e0e3e9733d3e48c6612dcf451d4361a8aa6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_auth_bridge::collab_union_policy::canonicalize (cognitive 31): op_auth_bridge::collab_union_policy::canonicalize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 12, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/collab_union_policy.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa35eca35eadb0187310744d3b87a3f69f59aa49394cfcc9e4a1c36ae5b3854"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::screen_sets::listed_whole_screen_names_en (cognitive 31): op_chat_agent::screen_sets::listed_whole_screen_names_en has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (19 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/screen_sets.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f8c41e2036a3e7061035a53e297b23d12caffed5f4342c0f85f11998915ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_relay_client::bridge::owner::run_owner (cognitive 31): op_collab_relay_client::bridge::owner::run_owner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (5 pts), loops 3 (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":"crates/op-collab-relay-client/src/bridge/owner.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf885ae9fd030add320b3dc917a9b0785f17d1d772e613f45a767cc4a3285b8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_path_data::absolute_segments (cognitive 31): op_editor_core::svg_path_data::absolute_segments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8111811084598856a93078dd7c008f02a009a5fea0c7cf87147584390274fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptCenterPanel::hit_test (cognitive 31): PromptCenterPanel::hit_test has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 3 (4 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":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd94c3a45139ecfa3f85d07343cbbf5ae08f7fa01253dde2674965ba27d2516"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::assignment::seed_assignments_from_instances::collect (cognitive 31): op_figma::instance::assignment::seed_assignments_from_instances::collect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (9 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. This shape REPEATS in the file: 2 other methods here (op_figma::instance::assignment::seed_assignments_from_instances, op_figma::instance::assignment::seed_assignments_from_instances::collect_geom) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e767cec17901d904eec564ee09bedebed15d17b53dc8174b2918bd5f7122b2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::paint_left_rail (cognitive 31): WidgetHostNative::paint_left_rail has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, match/switch 1 (3 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":"crates/op-host-native/src/widget_host/paint_rail.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ef289dcc88469c93aa527f23a2a51e4d6043eb203d90a1df3b4a6975bdb5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::cli_model_discovery_antigravity::parse_antigravity_models (cognitive 31): op_host_services::cli_model_discovery_antigravity::parse_antigravity_models has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 10, 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":"crates/op-host-services/src/cli_model_discovery_antigravity.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d70666c2a95f5142ca4b6fb439c22c5c0c0d7b29a60e2c0582c561066cd5c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_font_and_picker_tiers (cognitive 31): WidgetHost::press_font_and_picker_tiers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_property_tiers.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9e1496138f70827d60258ab62bf5c977d5fc13093da2c4bc3993d27863579"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_grid::wrap_grid_rows (cognitive 31): op_html::mapper_grid::wrap_grid_rows has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"43add1e89189137d5fadd2b962a6730955a3294b9e82c3d0b89710857fe7e21b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::resources_css_urls::unescape_css (cognitive 31): op_html::resources_css_urls::unescape_css has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 6, loops 2 (4 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":"crates/op-html/src/resources_css_urls.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c05cee3dd2321822cedd44c5ab880432f5b9da6d8e96ec651e51e6fbc5e6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::style_guide_context::infer_tags_from_prompt (cognitive 31): op_orchestrator::style_guide_context::infer_tags_from_prompt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 27, boolean chains 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":"crates/op-orchestrator/src/style_guide_context.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fefff3bb443b58c0348a549384113c66d9eb0c2217c200a4c690a3bb3065ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes (cognitive 31): op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 4 (7 pts), loops 3 (4 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":"crates/op-orchestrator/src/subagent.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4a04cce66f5281ef902cb934dd01bb1b26c946dacc49a638657b728b66a840"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::tree_heuristics_image_overlay::fix_notification_badge_overlay (cognitive 31): op_orchestrator::tree_heuristics_image_overlay::fix_notification_badge_overlay has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (4 pts) (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":"crates/op-orchestrator/src/tree_heuristics_image_overlay.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"388257f62f5dbd47d04aca1b5d60319844eb2391af208b6325db13dfc626d81b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_card_rail_fixes::collect_rail_width_collapse_fixes_with_context (cognitive 31): op_orchestrator::geometry_card_rail_fixes::collect_rail_width_collapse_fixes_with_context has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 4, loops 2 (4 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":"crates/op-orchestrator/src/geometry_card_rail_fixes.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"75df50858e79c915a2ae04e9c411fd0613491fdef44faaeb93abdd410179e507"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::design_context::collect_design_facts (cognitive 30): op_chat_agent::design_context::collect_design_facts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_context.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4ff5dead6f80732a468fbe66e65d19b4d9a46acde6b30f92c2880d6327f33"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::fingerprint::assign_pooled (cognitive 30): op_figma::instance::fingerprint::assign_pooled has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/fingerprint.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7768794eaa4428c3ff2e9916330a553de6605635767b2dc80896d53591505c0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::design_session::pump_commands (cognitive 30): op_host_desktop::design_session::pump_commands has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d8b46eb76b2ca503b0a530c0500998459400c9a0c04c2cf6ecfe8d6b3db3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_property_panel_tier (cognitive 30): WidgetHostNative::press_property_panel_tier has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_property_tiers.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8f3828e35675486b02a61488db630e1ad057380b7c78abeb80970fdba89293"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::chat_builtin_http_wire::pump_sse_response (cognitive 30): op_host_services::chat_builtin_http_wire::pump_sse_response has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts), boolean chains 2 (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":"crates/op-host-services/src/chat_builtin_http_wire.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ec385019ab47cf2aa42bd5489f6f91b4515709e83d068b22cb61d96fd7bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_git_text (cognitive 30): WidgetHost::apply_git_text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 1 (4 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":"crates/op-host-web/src/widget_host/keyboard_git.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9bd12e2ae6c22fb5ec4c5e2c30b51890e20edbcce83e9401dbb3895f7b762f"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewMotionState::observe_transitions (cognitive 30): PreviewMotionState::observe_transitions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eecfe7777d65c5af4915affd4fa641fec05cfe7691379ee166f4a4d63ede547"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_path_data::tokenize_path (cognitive 29): op_editor_core::svg_path_data::tokenize_path has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 2 (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":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"538fdb0c9858efe76e7a557b95fe188e00139a819d2fa1e10ec964ad19f4dda3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::path_data::tokenize_path (cognitive 29): op_editor_core::svg_import::path_data::tokenize_path has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 2 (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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"412d8edf0482845fd673e4977420f5140c02eb8a56ff2cba151ec339723bac0e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::layer_context_flow::apply_layer_context_ids (cognitive 29): op_editor_ui::widgets::layer_context_flow::apply_layer_context_ids has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_context_flow.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"363d7607aabeda6463c7d7dccd980bc7c14da7fd787eadcb44ede1adcda23151"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_fill_body::paint_fill_gradient_body (cognitive 29): op_editor_ui::widgets::property_panel_fill_body::paint_fill_gradient_body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill_body.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8344722d8338655f4c79359bdafd7c3ea3ab42f98a3dc057a0bfdede5217ccc9"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_menu_tiers (cognitive 29): WidgetHostNative::cursor_move_menu_tiers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d1346783928e67f528939d3147566b5855eb7934e8f417ee4aa102e1b02d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_home (cognitive 29): WidgetHostNative::press_home has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (10 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":"crates/op-host-native/src/widget_host/home.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a8e8045f0ebcd0c77d2fa4ab7d152d8137d98ac429f215501b351d87dce71"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_visual::map_fill (cognitive 29): op_html::mapper_visual::map_fill has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90557e1d30f5206e653c90315926a25b7e3a6dbfc86159188022fa328146013"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::project_zip_range::parse_html_zip_central_directory (cognitive 29): op_html::project_zip_range::parse_html_zip_central_directory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip_range.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eda29aa38df2713f0801d17ae652822b0040f152cf1d4933c43efd8c70657ce"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchGet::call (cognitive 29): BatchGet::call has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 7 (9 pts), loops 3 (6 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":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"182664f9c23de9c643a561f0315285c0c768281b9b069358378cb6f23ba1b1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_get::resolve_refs_in_node (cognitive 29): op_mcp::batch_get::resolve_refs_in_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"063542f9f0c19d36b2d2364cf88baf7caf14bd347eaa4cce47b24cf26c3fc84a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::sidebar_archetype::collect_restack_dependent_repairs (cognitive 29): op_orchestrator::sidebar_archetype::collect_restack_dependent_repairs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (5 pts), boolean chains 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":"crates/op-orchestrator/src/sidebar_archetype.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec24c023e0e97f48ea2be7ca3061c6f528035cc75137a6b5cc33014f90bb46"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::validation_dump::walk_dump (cognitive 29): op_orchestrator::validation_dump::walk_dump has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23 (27 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_dump.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9ff488c3888a917deb9a63d825b4c3a0bd645ef7c532493e8bd0388e4fa217"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::parse::normalize_generated_node_json_inner (cognitive 29): op_orchestrator::parse::normalize_generated_node_json_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/parse.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8bcd5b7100d762f475ff68bfebb86d6d11d933b0d4a1a905b7353f7c5cbc0c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_spill_diagnostics::collect_sibling_jam_diagnostics (cognitive 29): op_orchestrator::geometry_spill_diagnostics::collect_sibling_jam_diagnostics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 10, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_spill_diagnostics.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1a8ef0df3bf6e1bc85f47b73a8ceb43dc57fc2127f3f1a6369b8f9931fe033"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::mobile_content_rail::repair_mobile_content_rails (cognitive 29): op_orchestrator::mobile_content_rail::repair_mobile_content_rails has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_content_rail.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e4e1af2e4c889d83bc709b01377ab87c1e1c48ad67ca20a0c00fb4ffdbac47"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedDocumentReader.read (cognitive 29): BoundedDocumentReader.read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 1 (3 pts), boolean chains 1, loops 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":"packaging/ios/Sources/BoundedDocumentReader.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1c33d9c86329d9091708e7efad5d6c96c09583ae41838a505ae0a1d89cc01a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicToolCollector::handle (cognitive 28): AnthropicToolCollector::handle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai/src/chat_tool_sse.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"41026f5b2ae0717d8558b2bd65fab2857e3966b444b3700563ced95fe775b02e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_cli::parse_args (cognitive 28): op_cli::parse_args has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 9 (13 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/main.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"185d198ef08ef07feee23c9b949d47285a049d391dc1dd05c14b9f76b8c42e04"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::missing_fonts::component_override_font_family_stacks (cognitive 28): op_editor_core::missing_fonts::component_override_font_family_stacks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (11 pts), match/switch 1 (nesting depth added 15). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 2 function items inside it that branch (scan_json, scan_nodes). 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":"crates/op-editor-core/src/missing_fonts.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8980a8becec67dc13c51108274af1566d13e4c45e5035b9375df8e105b245400"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::lexer::scan_numbers (cognitive 28): op_editor_core::svg_import::lexer::scan_numbers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 6, loops 2 (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":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d3de9bfd9914f15770eeaaa2ff46b51b579f2ec089e23a863bbcdc27d59785"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_flex::paint_alignment_grid (cognitive 28): op_editor_ui::widgets::property_panel_flex::paint_alignment_grid has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 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":"crates/op-editor-ui/src/widgets/property_panel_flex.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6b1f4aa5bdb5e8ea4e7685437708a9256cbac0271f150773b6c81839463ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::decode_figma_path_blob (cognitive 28): op_figma::vector_decoder::decode_figma_path_blob has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 pts), boolean chains 1, 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":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"881f662461eb446e4445b355a86e41b6df6d55e2622bf233bc61d364f9fc69b9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::scan_numbers (cognitive 28): op_figma::vector_decoder::scan_numbers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc93bfc0d6b797e65df9d4a7a898523f24f7873997e096b1bf98429b8a31792"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::clipboard::decode_html_entities (cognitive 28): op_figma::clipboard::decode_html_entities has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/clipboard.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c315b78fd9e9822ec0cc44783c004e0dcd04860056c64c6652a3c459339b668"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::swap_filter::filter_swap_stale_derived (cognitive 28): op_figma::instance::swap_filter::filter_swap_stale_derived has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 3, 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":"crates/op-figma/src/instance/swap_filter.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f25be403de8c60a68729a8eb613064896f8b41615c8a20feff357dea5f4d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::handle_menu_action (cognitive 28): DesktopApp::handle_menu_action has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/menu_action.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9886629bad62407efc00f11920a153e0f95ac12a447f40a23f4ab297efdec3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_chat_standard::stream_modify_route (cognitive 28): op_host_services::web_chat_standard::stream_modify_route has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 1 (2 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":"crates/op-host-services/src/web_chat_standard.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd404e21af3eeda16e32fce3789b1bfa036dab95ba7090050814a1ee59595bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::focused_input_selected_text (cognitive 28): WidgetHost::focused_input_selected_text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (20 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_text_inputs.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19a439eb607f91bd404fdb1106f463b3957bc04c7e2d617f44036aec73c45b8"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetParser::parse_range (cognitive 28): SheetParser::parse_range has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"392c7253954ef29fb9eb526e71ea02e3eecd88041bb1e9ed18211a1b6353b4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_compound (cognitive 28): Parser::parse_compound has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c1f79e4521db95dd702e8f89fdbe97339813c8c46f50b80586b80429272fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_program_exec_ops::execute_image (cognitive 28): op_mcp::batch_program_exec_ops::execute_image has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_program_exec_ops.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7583f4d827331ad39d256c8ab9d61ebebabbf3541626a2a0b18a4eeeb512a293"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::nav_issues::scan_nav_issues (cognitive 28): op_orchestrator::nav_issues::scan_nav_issues has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 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":"crates/op-orchestrator/src/nav_issues.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1726ce9d236c95293592f07c28c8d1197f3b481fb0c396dcfd3935faae253ec"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_grow_fit_fixes::collect_absolute_fill_image_fixes (cognitive 28): op_orchestrator::geometry_grow_fit_fixes::collect_absolute_fill_image_fixes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_grow_fit_fixes.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aa9adf3b794eb3a1830a07fc0478638b601b5abe4b0a87a930f8fb237e3f59"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::validation_fixes::is_valid_fix_value (cognitive 28): op_orchestrator::validation_fixes::is_valid_fix_value has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (27 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0b3ab17685919d46b4b9339c71614bd8882347132911718717e08f4e557810"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_scale_ops::table_overflow_scale (cognitive 28): op_orchestrator::geometry_scale_ops::table_overflow_scale has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_scale_ops.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61b09ae541574aae9392ce745a529dd188eba88b0c12550a9b1201987c9f32d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::sibling_style_drift::plan_family_commands (cognitive 28): op_orchestrator::sibling_style_drift::plan_family_commands has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (11 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/sibling_style_drift.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ba4ebcb645c25a0bdac50c2d1a4fcfb33030bd8d279c006c662860557c421e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_codegen::codegen_html::emit_node_html (cognitive 27): op_codegen::codegen_html::emit_node_html has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 2 (6 pts), boolean chains 1 (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":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afdeb1838e787c557dc27fd68cffba071defa583d3c3b8333f8849f384e2c72"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_relay_client::session::pump (cognitive 27): op_collab_relay_client::session::pump has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-client/src/session.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d6266adc2439b8946ef8abce516f6ca37ede371b32f0c989b08d9e015c46d1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::resize_selected_bounds (cognitive 27): EditorState::resize_selected_bounds has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 3 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/drag_mutators.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fbd90c100f283cc64fd733c3f962bcc7a8c8f554a1c9c39905a17c07193a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::lexer::parse_attrs (cognitive 27): op_editor_core::svg_import::lexer::parse_attrs has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (11 pts), boolean chains 8, if/else 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c78aa19ce949ef5231dae7919b1864600c82786e97ac2fb7f6570eadcad6d0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::xml::parse_svg_tree (cognitive 27): op_editor_core::svg_import::xml::parse_svg_tree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (10 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/xml.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d9d94b00064d70541928e799528db5ffbfb4b4071431b0a2136eebf4249917"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::instance_override::route_display_state (cognitive 27): op_editor_core::instance_override::route_display_state has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"59866200055dd542055748c118b5f3d30cf35e5e688f0dcec5ebec04dccf321c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_host_core::settings_io::apply_payload_with_options (cognitive 27): op_editor_host_core::settings_io::apply_payload_with_options has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24 (27 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/settings_io.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83705a278d374aa33cc10c99dcbda7b114e613863b9bb09e145ab31ffe7cdf9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::variables_panel::menus::paint_menus (cognitive 27): op_editor_ui::widgets::variables_panel::menus::paint_menus has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 7 (9 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel/menus.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f919d5e4a5ed53093cf3bc351329e10c8392bc30e6eb4b8b8109bc939c3d2a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_panel::tabs::paint_tab_strip (cognitive 27): op_editor_ui::widgets::agent_settings_panel::tabs::paint_tab_strip has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_panel/tabs.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01394c1986ad4e607967578e563bed8d3a6186b3be423332cd204fbda01b3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_acp::hit_test (cognitive 27): op_editor_ui::widgets::agent_settings_acp::hit_test has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 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":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21b68d683cabab8cd05f987e9f499349b769153a4db3b4e77cbae6795102ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_images_parts::paint_search_input_row (cognitive 27): op_editor_ui::widgets::agent_settings_images_parts::paint_search_input_row has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c129c492921993f471a7c49bcd5695727adbc010dfb9eb6ea008d09a1bb95753"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_images::paint::paint_profile_header (cognitive 27): op_editor_ui::widgets::agent_settings_images::paint::paint_profile_header has cognitive complexity 27 (threshold 15). Drivers by points: if/else 26 (27 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"47907ddea56aae80533ab1d33710d32495638d9d34ecc556ee0f363de0ef4dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_image_popovers::paint_generate_popover (cognitive 27): op_editor_ui::widgets::property_panel_image_popovers::paint_generate_popover has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2abe091945797ddba3d4c683b9b8f951dc11e046d1696eea518f53f6838b99"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_ffi::desc::parse_create (cognitive 27): op_engine_ffi::desc::parse_create has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/desc.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a222f560d1c3b46d0755e492a2ff42d37f4f8f8aa852048d7fd6a79d43fc066"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::apply::merge_entry_lists (cognitive 27): op_figma::instance::apply::merge_entry_lists has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/apply.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18da80749148a9ab0400fd894ed7fe1065cb802c793c7791ad6962355e898f5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::converters::convert_vector (cognitive 27): op_figma::converters::convert_vector has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/converters.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cb6b37c0e1cd3c6b03cc785ce102d3a46744289ae819eeff14b1d3f7dd9d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::chat_acp::run_acp_turn (cognitive 27): op_host_desktop::chat_acp::run_acp_turn has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 10 (13 pts), if/else 4 (12 pts), loops 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_acp.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4338421b025f4dac5858784209470258920936e0357b951d78ba4f7257d668c"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_property_overlay_tiers (cognitive 27): WidgetHostNative::press_property_overlay_tiers has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 11, match/switch 1 (3 pts) (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":"crates/op-host-native/src/widget_host/press_property_tiers.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa27e4924fdd1f5226152c673e9ce5db7fc0878aed52502c81f44da63a6f592c"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_git_and_chat_tiers (cognitive 27): WidgetHostNative::press_git_and_chat_tiers has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_surface_tiers.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0770a56072bd043a33955cc56aa446fec19c14f7c9b4cf5ffa953bce87a2e06e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeProvider::send_inner (cognitive 27): ClaudeCodeProvider::send_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 6 (10 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_claude.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacab9397161327a1c1257df1779dbefdae53325efdd90aa8b3813cb3466aebc"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_top_bar_tier (cognitive 27): WidgetHost::press_top_bar_tier has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"288e121de3f02afa44e88746ba9b88066a34e9d4e4cb1955bc32ca911da299eb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::text_children::map_dom_children (cognitive 27): op_html::text_children::map_dom_children has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/text_children.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bed379e2ce2986cd08ecc940e19f6492ea8d05c6ff34f0bc918022fcdde2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::html_encoding::encoding_from_meta_attributes (cognitive 27): op_html::html_encoding::encoding_from_meta_attributes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (8 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":"crates/op-html/src/html_encoding.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db97e9e8e6042ea93a9920f78fc5f3f19cc284ecd4cd22ea50902e6b3753e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_layered_guidelines::generate_section_guidelines (cognitive 27): op_mcp::batch_layered_guidelines::generate_section_guidelines has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 12 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_layered_guidelines.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"987cde9bf6cd13ea770a1b907068d0888e9b5c19f3d50032f1c30c1488bf1481"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::parse::renest_by_parent (cognitive 27): op_orchestrator::parse::renest_by_parent has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (6 pts), loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/parse.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"85448165a9bd4bd5ba2870fcaea770511fcfad8bdcaff7dbeef09b32c1add5f7"}},{"ruleId":"D2","level":"warning","message":{"text":"op_pen_loader::style_payload::shader_payload (cognitive 27): op_pen_loader::style_payload::shader_payload has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 2 (4 pts), loops 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":"crates/op-pen-loader/src/style_payload.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a1f8f3335392414910bc1375c59ac6d304c55cfbbbb241a94fdd690ebe6799"}},{"ruleId":"D2","level":"warning","message":{"text":"op_pen_loader::layout_repair::repair_inferred_horizontal_container (cognitive 27): op_pen_loader::layout_repair::repair_inferred_horizontal_container has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13e8fa11c3d463d5f28f044ca43f60a54ba09670e3c2fa3dc2c86579dc94f16"}},{"ruleId":"D2","level":"warning","message":{"text":"op_util::image_dimensions::xml_attribute (cognitive 27): op_util::image_dimensions::xml_attribute has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 4 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-util/src/image_dimensions.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaed53e4171a09cedc5463ef168ed75aa00425e4a5e89cb87956da02c901f3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"run_matrix.main (cognitive 27): run_matrix.main has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 6 (10 pts), error handling 1 (4 pts), boolean chains 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":"scripts/ab-v9/run_matrix.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed3aeca35733a0d0167c230262bcc81f4d2137330de774465706eeeef04b2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-op-auth-candidate.main (cognitive 27): extract-op-auth-candidate.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2 (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":"tools/extract-op-auth-candidate.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd12ebc77df1b06df20df026d7db8ced46ce62076502749293b46f32083ee9e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab::ticket_json::decode_ticket_string (cognitive 26): op_collab::ticket_json::decode_ticket_string has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/ticket_json.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde341ee1d7101ca1d54119ace975e08f3e36d9c53ce26f614c8decc78dae3a"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::branch_picker_hit (cognitive 26): GitPanel::branch_picker_hit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_menus/branch_picker.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b2ae4611f2275c60c4660441c371b823198583f3e6b637fa61ff74b8ab0bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolbar::hit_test (cognitive 26): Toolbar::hit_test has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/toolbar.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e87f97039b96727b6035f9670b3bdc31ea251a7b088540cebb3be4fbd8768a"}},{"ruleId":"D2","level":"warning","message":{"text":"TopBar::hit_test_with_git_rect (cognitive 26): TopBar::hit_test_with_git_rect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7724148157aa2bf157bc5a1a8684034875e00585190a08ffd24e1bc30df138"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_flex::push_flex_action_rects (cognitive 26): op_editor_ui::widgets::property_panel_flex::push_flex_action_rects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (7 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":"crates/op-editor-ui/src/widgets/property_panel_flex.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"107e28f42746bb079afaff617c4f5d736c8c333ff10932399f3a81f2cd59ca86"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_design::extract_json_objects (cognitive 26): op_editor_ui::widgets::ai_chat_transcript_design::extract_json_objects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6610e0379d5fcbda088b98435471b4a311bc6d0f5d221c7e1810bb34ba36b85c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_image_assets::image_popover_action_at (cognitive 26): op_editor_ui::widgets::property_panel_image_assets::image_popover_action_at has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_image_assets.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2664c58ac0abf79448c57757ce4178698f4710d87cf06bf776c454c83892a7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::dispatch_icon_picker_press (cognitive 26): WidgetHostNative::dispatch_icon_picker_press has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/icon_picker_press.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b6fc70d24d51d4424c9012d86034cea7b7ee88964071616ede47518acf946f"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_canvas_select_tier (cognitive 26): WidgetHostNative::press_canvas_select_tier has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_canvas_tiers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"404c70a8fbfa4d8aad31ad0b5dbb4c67f55f6c5be6c0807f4a062051ebd77e84"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route (cognitive 26): op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 4 (7 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3d641a9e619947933175a4e0629f59d5e30b1a93fa520b98d9973cf263150"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::cascade::compute_raw (cognitive 26): op_html::css::cascade::compute_raw has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db48ab4940ad885d589b6d8fa220e817bbf5edc5efea3589ffa371924bd207d"}},{"ruleId":"D2","level":"warning","message":{"text":"ListUiKits::call (cognitive 26): ListUiKits::call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, loops 2 (3 pts), match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/ui_kit_tool.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce9a5e6f19c2ac04c573f203c9e92430a39209a39dd89b546ae903a89143e45"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_wire::capture_raw_json_value (cognitive 26): op_mcp::batch_design_wire::capture_raw_json_value has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_wire.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cde66ab07cbb170efb320d3b1e4c71892c71a6a8c0a42f9af52dba3e0a771b6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::tree_heuristics_image_overlay::convert_stacked_overlay_to_absolute (cognitive 26): op_orchestrator::tree_heuristics_image_overlay::convert_stacked_overlay_to_absolute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (5 pts), boolean chains 2 (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":"crates/op-orchestrator/src/tree_heuristics_image_overlay.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"11939688ec1589aafed61e4314a245573d409f3bca866c83504b6b3e0e460f96"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::text_contrast_repair::first_usable_fill_kind (cognitive 26): op_orchestrator::text_contrast_repair::first_usable_fill_kind has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_contrast_repair.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cb4f3db460d1f89ebea1936eeb609b0c4e4a217d52d8be2e7f6c90f81388ec"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::tree_heuristics_nav_rounding::merge_backdrop_child_fill (cognitive 26): op_orchestrator::tree_heuristics_nav_rounding::merge_backdrop_child_fill has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/tree_heuristics_nav_rounding.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f6cc10f963ece1f06045a6d6b8def590f86d9748cf4959e7fa57f19cf9f14e"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewSession::reconcile (cognitive 26): PreviewSession::reconcile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (6 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/app_mode.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad029a5a6884952e5b1c5a70c9ea6a2104dd462df358f469f0346ae7ee6f7622"}},{"ruleId":"D2","level":"warning","message":{"text":"OpEngineHost.drainShellActions (cognitive 26): OpEngineHost.drainShellActions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/OpEngineHost.swift"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf645235cbd9d6daada8ef092e8872e745a2cbd1993bbd36fe5c72289481f4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ck_image_cache.jpegFitsThumbnailBounds (cognitive 26): op_ck_image_cache.jpegFitsThumbnailBounds has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b91084330db15030a67cbc2d508e4da5581132c0737d76d60ef13fb15685d4"}},{"ruleId":"D2","level":"warning","message":{"text":"capturePage (cognitive 26): capturePage has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 6 (8 pts), error handling 3 (5 pts), boolean chains 3, 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":"packages/op-chrome-extension/capture.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a15ef13bc68b1af265b65e2d9e4c89c2f54455646375396e3661a84ff50498a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::design_md_import::header_tags (cognitive 25): op_ai_skills::style_guide::design_md_import::header_tags has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (7 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":"crates/op-ai-skills/src/style_guide/design_md_import.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce809837ea1a9bda911c21748f25dc6ef67a648d933e1a14a8cbc45048e60e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::screen_sets::listed_whole_screen_names (cognitive 25): op_chat_agent::screen_sets::listed_whole_screen_names has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 4 (10 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":"crates/op-chat-agent/src/screen_sets.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae57da166721485ecf881415fb1048c61a5726ca74d010aba1d38143f39174d8"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenPipeline::step_chunks (cognitive 25): CodegenPipeline::step_chunks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (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":"crates/op-codegen/src/ai/pipeline.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318c727dc23142a7cc6cda97be671174c774f5b8770a8eb160c131285905e21"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::active_text_input_mut (cognitive 25): EditorState::active_text_input_mut has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, boolean chains 4, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_input_focus.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf648aaa47d8dce7998d418ee58b86e182540b5b6aa0b17128065d3db0549f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"SlidesPanelTabs::paint (cognitive 25): SlidesPanelTabs::paint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (2 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":"crates/op-editor-ui/src/widgets/slides_panel_tabs.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8d6d6ebbded08e00f01c5c6358b95c010417034b414a9bc414e09c863813e4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_overlay::wrap_segment (cognitive 25): op_editor_ui::widgets::canvas_viewport_overlay::wrap_segment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"8718406b08720160b691e5a3e6ae9f0a52deeace4f79df15d4f66699b56e9c23"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_fonts::paint_fonts_tab (cognitive 25): op_editor_ui::widgets::agent_settings_fonts::paint_fonts_tab has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 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":"crates/op-editor-ui/src/widgets/agent_settings_fonts.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7800fd69c27e4a7d15d371568a981967effaf2def467f625177994c8ab901f69"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar (cognitive 25): op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e4ea39f3a4075a6a495601e723ddab97428afd85a1fc1649d890fcd951c9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopApp::on_cursor_moved (cognitive 25): DesktopApp::on_cursor_moved has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bed2e01e23842d8979c79aaabaaf0411d89bc3cd54a458c93fcb2f9134632f9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_credentials::validate_and_merge (cognitive 25): op_host_services::web_credentials::validate_and_merge has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_credentials.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"183fcbc455b4e6a8034c45b4b3edfc79ae78599e3715a4da3bcbe3a09b9ffc73"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_send (cognitive 25): WidgetHost::apply_send has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21 (25 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40aa1492c36956683a974b548448afa7f542909daf8576a2aa58986f1431eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_release_with_viewport (cognitive 25): WidgetHost::apply_release_with_viewport has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/release_input.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeca0910349a06e833bfb9932fe0f9e723633c4c24c5b3effcd2cfc5ad963061"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_normalize::normalize_pencil_autolayout_dialect (cognitive 25): op_mcp::batch_design_normalize::normalize_pencil_autolayout_dialect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (7 pts), loops 2 (3 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":"crates/op-mcp/src/batch_design_normalize.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4713cc931a35ea4db9847f6ca353809c87bec693cb73f58ab1182ff225c7872c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_row_fixes::collect_card_row_height_fixes (cognitive 25): op_orchestrator::geometry_row_fixes::collect_card_row_height_fixes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 3 (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":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"44efbcaf22026e0b9a8f816304b1a4c12778a1455a8854e68ec8e9c6add381f6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::table_repair::try_reparent_orphans (cognitive 25): op_orchestrator::table_repair::try_reparent_orphans has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/table_repair.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ff79705316bf33927820dd78b64bac3bd29fa8a3a1c6f0f36e2f395ba429c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::design_type::mentions_phone_dimensions (cognitive 25): op_orchestrator::design_type::mentions_phone_dimensions has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 7, if/else 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/design_type.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afca9158d11f1853a989f1e8c933e84753f607bb82d24e6a865c58a9f4c3e17"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan::explicit_mobile_size (cognitive 25): op_orchestrator::plan::explicit_mobile_size has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c82d6e95f14aa278f7b347f1865f4cd6a99fc8c32de1dbf00a72a132672f2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::text_contrast_repair::collect_contrast_offenders (cognitive 25): op_orchestrator::text_contrast_repair::collect_contrast_offenders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_contrast_repair.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c3c31567c90ab7703ed5a06c6205365788a375bd632929a9e22bc6cdef17d7"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewMotionState::start_node_animation (cognitive 25): PreviewMotionState::start_node_animation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"965eabc7b467cc1f34933afe8214202acb25f0f09693618ebc2b197a0f00fa7b"}},{"ruleId":"D2","level":"warning","message":{"text":"run_matrix.parse_corpus_yaml (cognitive 25): run_matrix.parse_corpus_yaml has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, error handling 1 (4 pts), loops 2 (4 pts), ternaries 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":"scripts/ab-v9/run_matrix.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"970cb2947b3c804c3d9ca511abc0c92e2defe7e627ab6dc19d035beff758f472"}},{"ruleId":"D2","level":"warning","message":{"text":"scene_preview_cards.main (cognitive 25): scene_preview_cards.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 2 (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":"templates/step0/_generators/scene_preview_cards.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b238672e9f0b40b9a3c7297c1b5819badea31b69172dd82895298f1c5de1548f"}},{"ruleId":"D2","level":"warning","message":{"text":"check-sw-imports.stripComments (cognitive 25): check-sw-imports.stripComments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 2 (6 pts), loops 2 (4 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":"packages/op-chrome-extension/scripts/check-sw-imports.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"72833836c7716fa68ab93c759345362c3c344c205c3dc3860b12314d579846ff"}},{"ruleId":"D2","level":"warning","message":{"text":"t (cognitive 25): t has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (7 pts), boolean chains 4, 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":"packages/op-chrome-extension/i18n.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1667ce8126a4d283a7f2875628d09b45540e4bc8cf75052f91164dd75f85958"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 25): (anonymous) has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 442, 464). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba65530abe500bd4bf801a0c5119830c5c1f1a6e3bfade99697f80c431b96f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::frontmatter::parse_skill_frontmatter (cognitive 24): op_ai_skills::frontmatter::parse_skill_frontmatter has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 5 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/frontmatter.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"73565e4acb56e20be56e2fb6310c8a7cc15232bdf5d4768b76ed0bf8c5cd114c"}},{"ruleId":"D2","level":"warning","message":{"text":"CssVariables::generate (cognitive 24): CssVariables::generate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (10 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":"crates/op-codegen/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"82212b1951f0c25bcb6a55e9cc2dd4e9cfcd1a64515e32691c7c0b4c291e8b13"}},{"ruleId":"D2","level":"warning","message":{"text":"op_codegen::ai::pipeline_preflight::plan_structure_issue (cognitive 24): op_codegen::ai::pipeline_preflight::plan_structure_issue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (7 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":"crates/op-codegen/src/ai/pipeline_preflight.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6745a5a4a5d5082f19ef77df50b045ae63962f919fb37932d9135258c7994ba"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::shader_budget::shader_issues (cognitive 24): op_design_lint::detectors::shader_budget::shader_issues has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/shader_budget.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c10bddaa4cf571ae5d3eceea912e46194e0af0d1ab185e6977f210ee9f7662"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::paste_clipboard_with_allocator (cognitive 24): EditorState::paste_clipboard_with_allocator has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/clipboard.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"978b442df5c89abf2d49db8407638cc8b41125f78b7257e2f3304e91699799d0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::icon_path_normalize::absolute_segments (cognitive 24): op_editor_core::icon_path_normalize::absolute_segments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aff8d31d5e794ed144a736137d7e41e44cbc7c2aba7760702c708885f5dbde"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_host_core::chat::chat_history_from_transcript (cognitive 24): op_editor_host_core::chat::chat_history_from_transcript has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, match/switch 1 (2 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":"crates/op-editor-host-core/src/chat.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f4107cce09b8167172758dae03b6784021e1bd78a1a29664fdb0ab8736e606"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::ready_hit (cognitive 24): GitPanel::ready_hit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_ready.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4ebc37c05775654fc1074f3dc54d46c463a56d0360e8b66acdf5f7821a6daf"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerPanel::hit_test (cognitive 24): LayerPanel::hit_test has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel_hit.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef719e2538fc07305f7d2b01d34c25ed42712a93388a1838a87cd31987384ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_mcp::paint_server_row (cognitive 24): op_editor_ui::widgets::agent_settings_mcp::paint_server_row has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, boolean chains 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":"crates/op-editor-ui/src/widgets/agent_settings_mcp.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7649675d4fab76064e7f8883d0b1920dabf9c720a647fbf43f1dc448e5773a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_paint_mask::push_path_mask_clip (cognitive 24): op_editor_ui::widgets::canvas_viewport_paint_mask::push_path_mask_clip has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4 (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":"crates/op-editor-ui/src/widgets/canvas_viewport_paint_mask.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fc507843b8f5ef866f7600562ce559075e103a9586e5a7d44fcd3efc2774f1"}},{"ruleId":"D2","level":"warning","message":{"text":"GestureTracker::handle (cognitive 24): GestureTracker::handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/input.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1f228b54f0e337a4c78fa15bd5d720c56f8b0d59ccd7cc2828cbb7a4056219"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::chat_session_launch::launch_if_pending_inner (cognitive 24): op_host_desktop::chat_session_launch::launch_if_pending_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session_launch.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6750b63eb7fc8544343f6eb47fb44e4375e85eccb4cddf85707b35e30f33fea"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::serve_rest_restore (cognitive 24): WidgetHostNative::serve_rest_restore has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint_pan_cache.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"98196be3597dbd3d88a7cd107f5b9e12838a0789f5cd4d1341afb94bedc8e662"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_canvas_server::handle_web_canvas_request (cognitive 24): op_host_services::web_canvas_server::handle_web_canvas_request has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 6 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d77eeaf565bd7f2f1eef9ce6e1f4b33465eb3d39d7a1ce2ab098655195c01f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::mcp_live::connection::serve_connection (cognitive 24): op_host_services::mcp_live::connection::serve_connection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_live/connection.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4875f28a0b79ac6b93d2311b0426c0c88b0fde21072bd02a54077956ae607c06"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::chat_spawn::well_known_install_paths (cognitive 24): op_host_services::chat_spawn::well_known_install_paths has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (10 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":"crates/op-host-services/src/chat_spawn.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e7d4e048a949217be4a40a506e6e40bb91bef14a89a8483321ca2c9828576c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::design_md_evidence_roles::from_sanitized_json (cognitive 24): op_host_services::design_md_evidence_roles::from_sanitized_json has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 4 (6 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":"crates/op-host-services/src/design_md_evidence_roles.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceabacfc74d67716ea7d35713b30a34259bafae25be829b05de9a4a7cb83f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::web_settings_validation::validate_credential_semantics (cognitive 24): op_host_web::web_settings_validation::validate_credential_semantics has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_settings_validation.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8ef6058bcf7c27a5ddb74a05e87f505a7f7d45aaa7ad1f6b9c9fcbfa8998f6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::web_settings_storage::apply_stored_snapshots (cognitive 24): op_host_web::web_settings_storage::apply_stored_snapshots has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 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":"crates/op-host-web/src/web_settings_storage.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae1e7cd97a86aa32103e0d76a31ef9fbb42352c3dfb208e0e6e399c01bbe59e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_visual::map_filter (cognitive 24): op_html::mapper_visual::map_filter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 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":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c259e248e55630fc5f02e4b07a81768a4b13b32400098be96bf652350af33a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::srcset::pick_from_picture (cognitive 24): op_html::srcset::pick_from_picture has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), match/switch 1 (3 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":"crates/op-html/src/srcset.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f6b613a5078727a5fcd41a10513134d9da0d1feb4221a55d26a4c3b2a1afaf"}},{"ruleId":"D2","level":"warning","message":{"text":"op_image_enrich::net::providers::catalog::fetch_openverse_token_with_source (cognitive 24): op_image_enrich::net::providers::catalog::fetch_openverse_token_with_source has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 1 (2 pts), boolean chains 1, 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":"crates/op-image-enrich/src/net/providers/catalog.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4980fd02b311f3a82205fafeae972dbd034afd50b9f255dae6f33a9a28318c63"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::variable_binding::bind_fills (cognitive 24): op_orchestrator::variable_binding::bind_fills has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 2 (8 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/variable_binding.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"55319d926adaef7c58f593a72e583e9f9d56cdb569fe2964df76faa4e23b591d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::text_fit::collect_text_fit_command (cognitive 24): op_orchestrator::text_fit::collect_text_fit_command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_fit.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e10179b943f56d67e25f30e9fcd6ac8244a3a02a11c46ef9a7fcbabc6a8066"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::wire_screen_navigation::wire_nav_tabs (cognitive 24): op_orchestrator::wire_screen_navigation::wire_nav_tabs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 4 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/wire_screen_navigation.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8818f5770a9c25557fb0281b5f342d395eeef6aff52ca68dd2dc97c9c08ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::validation::run_post_generation_validation (cognitive 24): op_orchestrator::validation::run_post_generation_validation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cb6bdcb36eca6a04663b989a9f46127c9faadb62a1e6cd4e449ebd4599159f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_layout_post_pass::fix_horizontal_overflow (cognitive 24): op_orchestrator::role_layout_post_pass::fix_horizontal_overflow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 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":"crates/op-orchestrator/src/role_layout_post_pass.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"183119c50b3a600ee23b2901b56ea39e97c2c6240742d976e2a93ab02ab6afd3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::parse::resolve_numeric_design_token (cognitive 24): op_orchestrator::parse::resolve_numeric_design_token has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 9 (11 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/parse.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6984f0626b2925e594b0b84b565d176ff6e32d4d652e871b4f699cb4487a864"}},{"ruleId":"D2","level":"warning","message":{"text":"OpSurfaceViewShellBridge.pollShellAction (cognitive 24): OpSurfaceViewShellBridge.pollShellAction has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceViewShellBridge.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d63d36b776038c6baaf8f195135d8fe7f4beab77b13eeb39184901414611c0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web.debugString (cognitive 24): op_host_web.debugString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, error handling 1 (2 pts), loops 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":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a60fedabaa6d6e6ad273166bfd0f6e696a62f0de53dcbdc377d7c50bf4758f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web.debugString (cognitive 24): op_host_web.debugString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, error handling 1 (2 pts), loops 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":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46477d58eb06c208a239718ce809d65825d674ac0ab7165738c17aeb14927b4"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.parseInboundFromPage (cognitive 24): bridge.parseInboundFromPage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, error handling 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":"packages/op-vscode/src/protocol/bridge.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec5d9c0f0b99016bf0b9465dff1f88f6b6ec9b23649fbafa0097f67271c205d"}},{"ruleId":"D2","level":"warning","message":{"text":"collectDesignEvidenceInPage::toHex (cognitive 24): collectDesignEvidenceInPage::toHex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (8 pts), boolean chains 6 (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":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cf191897d4c089deac4da7158a0d101d2e9b95f0261de3bf66a394952b1e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::budget::trim_by_budget_pinned (cognitive 23): op_ai_skills::budget::trim_by_budget_pinned has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/budget.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"83303750fade7e17e939192b1f096f090aa493972ab08503ce63eb9f75f2fd7d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::parser::extract_radius (cognitive 23): op_ai_skills::style_guide::parser::extract_radius has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/parser.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"df216b9df145cd9b8aee1ff6ca846d51b269f15ef6667885bdbd084869f95fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chrome_extension_core::design_md_validate::treatment_json_is_valid (cognitive 23): op_chrome_extension_core::design_md_validate::treatment_json_is_valid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33d066407ebb17cc0e312dc7cb2e77ed8989033d4822e83ec105fc2afe33c86"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_relay_server::connection::serve_connection (cognitive 23): op_collab_relay_server::connection::serve_connection has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11 (13 pts), if/else 8 (9 pts), boolean chains 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da1063379d9a2f4a645b4a59df9bee7aacd15ccf8972a8322f875ac65a0ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::siblings::check_consistency (cognitive 23): op_design_lint::detectors::siblings::check_consistency has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/siblings.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aaf0f412d045578a3d8406e52db23a8457f168fbedbf92a7aa00811cd0721e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::instantiate_kit_component_under_parent_with_allocator (cognitive 23): EditorState::instantiate_kit_component_under_parent_with_allocator has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/uikit_allocator.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad1c5f88161e30688a8afd3ca5992781d445ec7f761239d3ddd103ace60489b"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::paint_branch_picker (cognitive 23): GitPanel::paint_branch_picker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, loops 1, 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":"crates/op-editor-ui/src/widgets/git_panel_menus/branch_picker.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ca8041c65ea5315e2b079c00d6e08a3808b5d0f4580f62f9af535934c43c56"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_paint::shapes::paint_ellipse (cognitive 23): op_editor_ui::widgets::canvas_viewport_paint::shapes::paint_ellipse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint/shapes.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6806ef2ea26ef8a487f9d7208e656c4e342c77079073811810db87d49e123c2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_typography::build_font_picker_entries (cognitive 23): op_editor_ui::widgets::property_panel_typography::build_font_picker_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b95ed3fab591e0b0f67c35f1c35fd523be9899d38102a8144b7242f88d74b3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::variables_panel::paint::paint_rows (cognitive 23): op_editor_ui::widgets::variables_panel::paint::paint_rows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 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":"crates/op-editor-ui/src/widgets/variables_panel/paint.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71724c83fcf1e578ea2183ba58daf1213cff1455649519a0f6285edabee4fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::foreign_session::resolve_group (cognitive 23): op_figma::instance::foreign_session::resolve_group has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 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":"crates/op-figma/src/instance/foreign_session.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0c9b09a0c81a14b0be8b4ab5fb2cd8c63696073ddce316b8785740a855bdd2"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_base_tiers (cognitive 23): WidgetHostNative::cursor_move_base_tiers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_chrome.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a89d1fce600a3966e39e15e74c50815f7693d2d5ab2d7a180da6f8704683d0"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::update_dropdown_hover (cognitive 23): WidgetHostNative::update_dropdown_hover has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/geometry.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d93bd7956e05dbb1c241dfa8dadb347be75e7e63f56e4b83881b35edcbe6e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::blit_slide_thumbnails (cognitive 23): WidgetHostNative::blit_slide_thumbnails has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"959c561c226690a545ecc326f1d8a37c7de19d501a92c33be7b83ec8bd91c89c"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltInProvider::send (cognitive 23): BuiltInProvider::send has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_runtime.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce697d9654406124400798dc38fa410c32e8490fa0db0936e0bf0d4b0cb260a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::export_pptx::unexpressible (cognitive 23): op_host_services::export_pptx::unexpressible has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, match/switch 3 (4 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":"crates/op-host-services/src/export_pptx.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d359d49de18ad3dc96cfc5061364a9b833aa3643b7d440349ed90f591017a266"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::design_md_evidence::validate_evidence (cognitive 23): op_host_services::design_md_evidence::validate_evidence has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 8 (9 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"95517218e2414ea38c584b54503a82868d0fe588cc0002579ba28c1ec58f62e2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_grid::resolved_track_widths (cognitive 23): op_html::mapper_grid::resolved_track_widths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a01672c6f0bac7b58fc1601941933ac62c7b838a8270477c05761c7100dc95"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::declaration_syntax::split_whitespace_top_level (cognitive 23): op_html::css::declaration_syntax::split_whitespace_top_level has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, 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":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a53a5dfcd7222d13e62c0ecd5c55c78ba2eb52ffceeeb50dc61d0cbf48d8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::codegen_plan_store::submit_chunk_result (cognitive 23): op_mcp::codegen_plan_store::submit_chunk_result has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 2, boolean chains 1, 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":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79483f0c97d57889433a8d4f44615e21e42d78277d19c6a694b64ef835c5aae"}},{"ruleId":"D2","level":"warning","message":{"text":"op_opmerge::remap_colliding_image_ids (cognitive 23): op_opmerge::remap_colliding_image_ids has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 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":"crates/op-opmerge/src/lib.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd385596b77451b985629f91b4bb13ad8c8a370503f5dc29963c8b0b3f3cceb5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::variable_binding::bind_node (cognitive 23): op_orchestrator::variable_binding::bind_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/variable_binding.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6348e913e48b209946fa0a93c23d66c9e0e60199a969ff3765e1b8b1f69d696d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::compact_prompt::build_compact_planning_prompt (cognitive 23): op_orchestrator::compact_prompt::build_compact_planning_prompt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 5 (6 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/compact_prompt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279cf564b66fcd747107f45ec538c9d171a32416a5931163a148d1907d88184"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_overflow_fixes::collect_oversized_image_fixes (cognitive 23): op_orchestrator::geometry_overflow_fixes::collect_oversized_image_fixes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), 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":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f9fcdd1ba57155162effb514f3131997f782bd096b11679d5d433dccf617e5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::ring_repair::apply_wrapper (cognitive 23): op_orchestrator::ring_repair::apply_wrapper has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/ring_repair.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d286f021fbd6cdd78b7ab093481cbc913393fc04a060b271056a762e6f127b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::category_grid_density::collect_repairs (cognitive 23): op_orchestrator::category_grid_density::collect_repairs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04a9f03d7620d27a9cffbf6cc436f5da9b1a7311b7666501f05075a6e504686"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewMotionState::observe_in_view (cognitive 23): PreviewMotionState::observe_in_view has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"79be572373fe1ba24e521fb72d61789522370eedf35aed6b2f3fffeba104f10e"}},{"ruleId":"D2","level":"warning","message":{"text":"LineStreamChild::kill_graceful (cognitive 23): LineStreamChild::kill_graceful has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-process-io/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7896d2e1b07a6f4e7f3ff66bf74a61d05518c78971147845fb49bbd8764f70"}},{"ruleId":"D2","level":"warning","message":{"text":"op_smoke::image_fill::fill_images (cognitive 23): op_smoke::image_fill::fill_images has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 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":"crates/op-smoke/src/image_fill.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f3b78a94cad94f570b27214a80d9d84ecf7a94db494348458a479772d0155d"}},{"ruleId":"D2","level":"warning","message":{"text":"startPick (cognitive 23): startPick has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 3, error handling 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 9 function items inside it that branch (elementAt, draw, teardown, \u2026). 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":"packages/op-chrome-extension/picker.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd5780897aa8225b097b507aaa12d22d5c39dc9ac8cc79b237e2eb363aa14d8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_codegen::codegen_targets::emit_node_jsx (cognitive 22): op_codegen::codegen_targets::emit_node_jsx has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (6 pts), boolean chains 1 (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":"crates/op-codegen/src/codegen_targets.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e29343bb006445931843eb1536aaee39ee8bf3cbf8119971438333a5a57921"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::spacing::walk_stacked_horizontal_padding (cognitive 22): op_design_lint::detectors::spacing::walk_stacked_horizontal_padding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3beb0bc256dbdb2f2118826ab75d99decc616ded48e64ef1c65075e35a6e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::move_node_to_drop_target (cognitive 22): EditorState::move_node_to_drop_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, 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":"crates/op-editor-core/src/drag_mutators.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"104d1913710c91af08de2b181df3aa76053eb9aedf753f3c26916080b108091d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::instance_child_override::split_instance_child_anchor (cognitive 22): op_editor_core::instance_child_override::split_instance_child_anchor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 2 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_child_override.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2a75701abf5f04f3336f4fbb74837a949add6a6bf8d848e4ec22cc698450f4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_host_core::settings_io_checked::validate_credential_entries (cognitive 22): op_editor_host_core::settings_io_checked::validate_credential_entries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 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":"crates/op-editor-host-core/src/settings_io_checked.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2838da93186c951560964a39965eaa09f0130bd42f3d1df6378ea96431e2f7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"DesignMdPanel::section_lines (cognitive 22): DesignMdPanel::section_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/design_md_panel.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"57355739708d7bcb9d062187700621b483dbc2628d0fb1e52c3e7eefc8c208b1"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::paint_tracked_picker (cognitive 22): GitPanel::paint_tracked_picker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_tracked_picker.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f4ad81ab9d50718ae9a0f2fb355b15c284c6f39dd993c00f9ef40a98af8e33"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptCenterPanel::hover_at (cognitive 22): PromptCenterPanel::hover_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a9939bb28a4f133c548ff84aa2e11e46245dde10289c2a6f7f23f89c0f1a33"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::chat_click_flow::apply_chat_hit (cognitive 22): op_editor_ui::widgets::chat_click_flow::apply_chat_hit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/chat_click_flow.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7da2d8c579210e9eb70108034e13148a19668f9fc39c213599998cd4471af2c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_code::code_action_rects_with_bottom (cognitive 22): op_editor_ui::widgets::property_panel_code::code_action_rects_with_bottom has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_code.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d490fbc70ec7144b50e127735bc67adac5247b806cbc3eb551f4ccf94f857c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::home_surface_copy::task_copy (cognitive 22): op_editor_ui::widgets::home_surface_copy::task_copy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 6 (7 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_copy.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"71012b630633172942104c17ee2bbdd356cba43e70b0b717d055d7cb76cc3b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card (cognitive 22): op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 3 (5 pts) (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":"crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf31659e00208de35c6d8f998edfccb64d04ddfffa833bc766ffd8b1f6b95bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::host_canvas_geometry::path_anchor_hit (cognitive 22): op_editor_ui::widgets::host_canvas_geometry::path_anchor_hit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/host_canvas_geometry.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0379eefa3fdb5427fd476541e01c8d6acf3cf2dfecafaa43f9a10c24f8e8359"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageSearchSession::poll_into_with_optional_scene (cognitive 22): ImageSearchSession::poll_into_with_optional_scene has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/image_search_session.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60458b5e5da11a5c04a9908ebc36f3a8c950e9663028257b5cfa9ae02344f42"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::design_md_host::run_mcp_design_md_provider_blocking (cognitive 22): op_host_desktop::design_md_host::run_mcp_design_md_provider_blocking has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_md_host.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"937c5053ec3119755702346dd47de4c1640c44ae2bd186aba93288cf5b66f060"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_top_bar_tier (cognitive 22): WidgetHostNative::press_top_bar_tier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (7 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":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9cc5a5176124290f5a6eec4043688c319182f50e62edc60497219ad3f52d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_topmost_overlay_tiers (cognitive 22): WidgetHostNative::press_topmost_overlay_tiers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 4, match/switch 1 (2 pts) (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":"crates/op-host-native/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f9b4fe278c16be7ea536607b0fa57a4143c93e3765cda977f6550f521fed5a"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_input_select_all (cognitive 22): WidgetHostNative::apply_input_select_all has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (19 pts), match/switch 1 (3 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":"crates/op-host-native/src/widget_host/shortcuts.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ac9e46e270b64f286801388e2f20df2a0cc30cb8bdfb83884820aec554825"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfiguredBuiltinProvider::send_inner (cognitive 22): ConfiguredBuiltinProvider::send_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 6 (7 pts) (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":"crates/op-host-services/src/chat_builtin_http.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc6098af952036ad9ef489ff7300e493f10309ff4463f94b1699bede77b54d0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_canvas_server::run_loop::run_web_canvas (cognitive 22): op_host_services::web_canvas_server::run_loop::run_web_canvas has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts), boolean chains 3, 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":"crates/op-host-services/src/web_canvas_server/run_loop.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb281e3321cf0d160bb13f0128c92e114a3cbfaa467759c107351a2377608b13"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::chat_http_server_error::format_opencode_error (cognitive 22): op_host_services::chat_http_server_error::format_opencode_error has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_http_server_error.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"534bd92a334eb212fb2a833bc1c4978acf0c0f0365a3e479095fb22c402ec7d2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::zode_import::import_from_config (cognitive 22): op_host_services::zode_import::import_from_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 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":"crates/op-host-services/src/zode_import.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faff45222decffaa2c9c299f0048b5504cf3a90be97e7726dd039b6f516cbcb"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_git_send (cognitive 22): WidgetHost::apply_git_send has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_git.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50bec8f5f7b041de0e97b77573759559bccd37bcff8fca551004df84875a940"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_node_drag_cursor_move (cognitive 22): WidgetHost::apply_node_drag_cursor_move has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 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":"crates/op-host-web/src/widget_host/node_drag.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d777cab9492ebc2e642530aa4838ce394ec4e0af9735e98a75d2a1f6bf9b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::paint_menu_modal_and_panel_layers (cognitive 22): WidgetHost::paint_menu_modal_and_panel_layers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/paint_overlays.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e09df576345ebe4e2f6e7ed70504aa3b6588c94b9d35423e2720a7422bb5096"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_rail_overlay_tiers (cognitive 22): WidgetHost::press_rail_overlay_tiers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98ec80a823db359d73ec32c7b4b729d81bbb9bac10b399b7d72ce3fb4b30737"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::resources_css_imports::expand_inner (cognitive 22): op_html::resources_css_imports::expand_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1, 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":"crates/op-html/src/resources_css_imports.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e277ea62e25a6fc5328c37cc217d37c4e926e0746e4f2ab5bbe5e48a08b6751"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::transform::split_functions (cognitive 22): op_html::transform::split_functions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/transform.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0993dbc94f410b6acbb38dea3e14922e5c9d9619707127b0a613abaf33839d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_dsl::assemble_insert_forest (cognitive 22): op_mcp::batch_design_dsl::assemble_insert_forest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (7 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_dsl.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8334334e3ae5083fa3f3847ef3dfc293a008e4a2fdf52d23ebbd01183a2b06f5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_post_pass::surface_structure::fix_structural_wrapper_transparency (cognitive 22): op_orchestrator::role_post_pass::surface_structure::fix_structural_wrapper_transparency has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/surface_structure.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f32fa7cf4940887b2f2bb313e9af5cc4caf2c13199ea7f54b6fcd1f6375c53c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_row_fixes::collect_row_gap_fixes (cognitive 22): op_orchestrator::geometry_row_fixes::collect_row_gap_fixes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f749c09f63e2839e03c2973a094a5f8209ed3c426ffe42a45042a6d4c14eed73"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::mobile_reflow::candidate_for_root (cognitive 22): op_orchestrator::mobile_reflow::candidate_for_root has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 pts), match/switch 3 (nesting depth added 1). 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":"crates/op-orchestrator/src/mobile_reflow.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6243376b0db4261668b60eaa2d53bf432fa1a8249a06ab69849f64e23f51584"}},{"ruleId":"D2","level":"warning","message":{"text":"oplib.text (cognitive 22): oplib.text has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/oplib.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af9c94ecaaa38f6b47719f01c825837539dec2d25a062ea43f9b3ab601a8fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"background.chrome.runtime.onMessage.addListener() (cognitive 22): background.chrome.runtime.onMessage.addListener() has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 442). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3251dabdfdee6a76e450e73254ab12e66bf5394a4f180ad69aed7154043684cc"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-version.skipJsoncValue (cognitive 22): sync-version.skipJsoncValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/scripts/sync-version.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"305f2fafc691e01556addfe5b4274e48530295c605b2deca4fbe880c2c31397e"}},{"ruleId":"D2","level":"warning","message":{"text":"opCkInit::registeredCoverageSegments (cognitive 22): opCkInit::registeredCoverageSegments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fe14b47274ef1438da79b44a384f58d7e3d0d79a041628f9b27da342ce2a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"opStartFigmaTempImport (cognitive 22): opStartFigmaTempImport has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 8, ternaries 2 (4 pts), error handling 2 (nesting depth added 2). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 9 function items inside it that branch (onmessage, finish, releaseWorker, \u2026). 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":"crates/op-host-web/src/figma_temp_worker.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"4969c833fdee17818dc418c629cf21814105a7f0bb33940afc6caaebe5f5911a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::token_table::extract_table_colors (cognitive 21): op_ai_skills::style_guide::token_table::extract_table_colors has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 1 (3 pts), loops 2 (3 pts) (nesting depth added 3). 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":"crates/op-ai-skills/src/style_guide/token_table.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aaa8f6f24bf7039baba3898dea47708cbcc59bdf76d9dd586d4dd599eb3c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::chat_agent_loop::pump_sse (cognitive 21): op_chat_agent::chat_agent_loop::pump_sse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 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":"crates/op-chat-agent/src/chat_agent_loop.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec6d16b426c89f07fa4d4dc847211cbc884764df016bc31372783d421039bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::plan::detect_and_plan (cognitive 21): op_design_lint::plan::detect_and_plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 6 (9 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/plan.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc0ca8b9670ce6af2ac2a5175417a1ba95c5a71b1ab6d9ca3b34d6efd5a4869"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::workspace_surface_paint::paint_toolbar (cognitive 21): op_editor_ui::widgets::workspace_surface_paint::paint_toolbar has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 1, 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":"crates/op-editor-ui/src/widgets/workspace_surface_paint.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"590b770cc4fef6026f5b126ef3bc4df46bc9ee057290b41f9825f931773e948e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_ffi::editor_chat_turn::pump_sse_response (cognitive 21): op_engine_ffi::editor_chat_turn::pump_sse_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/editor_chat_turn.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4fc9abc575030da3fa0658d533655f856c17ebe3f4bf26a59ea70f07275928"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_ffi::input::apply_tap (cognitive 21): op_engine_ffi::input::apply_tap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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":"crates/op-engine-ffi/src/input.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee83365d87b881694b6d41f5e9be97f728bab8ffeeee46fb6320fd032b945820"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_ffi::editor_chat::execute_tool_requests (cognitive 21): op_engine_ffi::editor_chat::execute_tool_requests has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, 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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b01c658b945ff406bb74b3bb707231415d4d087fadadd14bcbf29807c4836f4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_jni::engine_thread::run_loop (cognitive 21): op_engine_jni::engine_thread::run_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 2 (6 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":"crates/op-engine-jni/src/engine_thread.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f11fbd22a6ebd2b0b978c83de8ad9d386660cb97a072bea8cd5bdd30848ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::collect_top_level_blocks (cognitive 21): op_figma::collect_top_level_blocks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/lib.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2179cd2f612befc5bbe1a5257f0a0f812d92fd2d5361b4d06e7c08409eec2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::container::fig_to_binary_parts (cognitive 21): op_figma::container::fig_to_binary_parts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/container.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7d83b1e5e7da4318e79742c2ebaeb92bac2b23606027c3eaa6263d430dfd03"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::chat_session::pump_with_channel_interleave (cognitive 21): op_host_desktop::chat_session::pump_with_channel_interleave has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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":"crates/op-host-desktop/src/chat_session.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e461ed89226e31fa3ec893f95644205911260674b5cb29c725bbda2f34b40046"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_mobile_modal_surface_tier (cognitive 21): WidgetHostNative::press_mobile_modal_surface_tier has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 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":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"07983b32a2181f182c6cec62303708361f716fc335ccdfaaee7525ae165e96c8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_chat_standard_model_selection::selected_model_id (cognitive 21): op_host_services::web_chat_standard_model_selection::selected_model_id has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 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":"crates/op-host-services/src/web_chat_standard_model_selection.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e8b10f3a730baf8f4a5c08c4b9970ec72ad1863e54e515622e8606de00c3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::dispatch_icon_picker_press (cognitive 21): WidgetHost::dispatch_icon_picker_press has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/icon_picker_press.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b5dccbb60f8d4174d23b6c5949ffe23234518813ceee7e2ff219a9a5de83e9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::widget_host::group_ops::trace_grid_contours (cognitive 21): op_host_web::widget_host::group_ops::trace_grid_contours has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/group_ops.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32b600a46dc815050f8ae80a7feb9b9fded76ddb9cc2d27444d6fefd3f7112b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_grid::expand_fixed_tracks (cognitive 21): op_html::mapper_grid::expand_fixed_tracks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4b44b39d17413523cd5c1806f2403ca0ea6382e2c513fb5218a44d0ec1e53a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::special_image::parent_content_box (cognitive 21): op_html::special_image::parent_content_box has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, match/switch 2 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d04b284566ffd9fd4bf75d7e0605d0367b9cc8b4196dd42ea2eec2d0869a45"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::html_encoding::extract_charset_from_content (cognitive 21): op_html::html_encoding::extract_charset_from_content has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/html_encoding.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"878add3fbda6a96b046fd8b78a00e3f85b1bad0a13e485234fad4ee10a1e327b"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyState::resolve (cognitive 21): DependencyState::resolve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store_dependencies.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ccae1c71b5de8a81d410b54b55216df476803d4c6545bfc0e0fc1f968bfcee"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_program_parse::replace_single_quote_delimiters (cognitive 21): op_mcp::batch_program_parse::replace_single_quote_delimiters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, 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":"crates/op-mcp/src/batch_program_parse.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb865446587d7c69bd246d43d461767c4847f849b03feecb89f929bb29e887"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_wire::parse_item (cognitive 21): op_mcp::batch_design_wire::parse_item has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_wire.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6747b8e0245fb231af740046f958defb53aac9f07d6172fd79e4e0bd8bf5027"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design::dispatch_batch_design (cognitive 21): op_mcp::batch_design::dispatch_batch_design has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"369ac68d00a762341b2cd835ec0b93a236322355c7e58d81267b83578ff27e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup::run_cleanup_passes_with_summary_and_policy (cognitive 21): op_orchestrator::cleanup::run_cleanup_passes_with_summary_and_policy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, 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":"crates/op-orchestrator/src/cleanup.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83e364e34f8e1ee4d12a9082dc539489f61cdc4f61fd2bb571a99e23befe897"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::tree_heuristics_card_decoration::strip_nested_card_decoration (cognitive 21): op_orchestrator::tree_heuristics_card_decoration::strip_nested_card_decoration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/tree_heuristics_card_decoration.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfbe0cb5007642e36a7771da84fccc50bebf4716f5426b69d56f6875318fa67"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::collect_copy_group_triggers (cognitive 21): op_orchestrator::cleanup_slide_padding::collect_copy_group_triggers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, 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":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"edee9a74b5b74795b8dc8b1238e3c734927f912b7c4b07c91f2bc561d29a1a92"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthCodeFormOverlay.submit (cognitive 21): AuthCodeFormOverlay.submit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1 (nesting depth added 11). 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c89d68146dff7da02d5ea1ca56f192cde5e26afe7871f644a07f1982e8f9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-extractor.buildImage (cognitive 21): snapshot-extractor.buildImage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1 (2 pts), ternaries 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":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"539ecea11a5fd8f19df1d980cc21cc7f00b1bc9fda4a5640ec9b190a84b30be3"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-extractor.inlineSegments (cognitive 21): snapshot-extractor.inlineSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 2 (4 pts) (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":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"14de815136eef8e096f1590f6976b6138b73e66782436100750e9906fd01c167"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-extractor.buildInlineRun (cognitive 21): snapshot-extractor.buildInlineRun has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"9968e69515a4314e60e9927e743492b51de8fddf706961ec9c0279c59b2c4538"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::buildImage (cognitive 21): (anonymous)::buildImage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1 (2 pts), ternaries 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":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ca932ffe60fba026aa9a8ca4bd7febc049e693cb202ff4ed3b976201ec290d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::buildInlineRun (cognitive 21): (anonymous)::buildInlineRun has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce49974584cd3bf13742352d1a1aa38d1f80002ed3989cccc60ab3474b11790"}},{"ruleId":"D2","level":"warning","message":{"text":"TruncationScanner::step (cognitive 20): TruncationScanner::step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/transfer.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9741be3edfc6e4f2440ed15f2f58c282bde7b78be643be759d775d2dcdfe5c1"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestSessionCore::handle_undo_result (cognitive 20): GuestSessionCore::handle_undo_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest_sync.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab8dfda8dd9943bce46c4dda9e1be7aba6e5f7a631fdf9ce8cc1afda5f98eba"}},{"ruleId":"D2","level":"warning","message":{"text":"UndoLedger::record_commit (cognitive 20): UndoLedger::record_commit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/undo_ledger.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a813adf754a651ad01f66a18a9eb85439032a2584628205648a2580786abbf"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_relay_server::connection_wait::wait_for_pair (cognitive 20): op_collab_relay_server::connection_wait::wait_for_pair has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection_wait.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3e5a5a8f40aed9dc2279ee7b0f620d214803c0e20f32a1c18a1ada8868d098"}},{"ruleId":"D2","level":"warning","message":{"text":"Reassembler::push_inner (cognitive 20): Reassembler::push_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/chunk.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c6315dc53df71d731618c51f921b0401d3d439e995b3415d941458a8d23ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserState::emit_service (cognitive 20): BrowserState::emit_service has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/discovery_bonjour_browser.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c330118b849b4691230c4a3ade0df7a21879401ca285a15219d30442eab4402"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalRecordDecoder::poll (cognitive 20): IncrementalRecordDecoder::poll has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/driver_io.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcffa07d2ba481705fab0e96c57d1389afb3571e0236595c08f842e2c849ccb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SecureConnection::receive_transfer_inner (cognitive 20): SecureConnection::receive_transfer_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/runtime.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b343f9777ef0a0976ed0c110d689fe1a5e88086435346a5ad19da5530b498df"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::top_anchored_bars::find_bar_groups (cognitive 20): op_design_lint::detectors::top_anchored_bars::find_bar_groups has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/top_anchored_bars.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d087a19fd80053970eaf75c065ac705418e99e0903973d3606909f5e7d826f"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::cmd_set_ellipse_arc (cognitive 20): EditorState::cmd_set_ellipse_arc has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node_attrs/state_ops.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f224f4fb3e83ac6992c71b61b493595b6fa3941cecb725509f0c061f5f8d3bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::nodes::element_to_node_ctx (cognitive 20): op_editor_core::svg_import::nodes::element_to_node_ctx has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, 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":"crates/op-editor-core/src/svg_import/nodes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3ebaba36f92d42f7b3cb06ec0273f4e043ebf81c22d31c2c9a9aa7452612b2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::host_ui_transitions::settings_text_payload (cognitive 20): op_editor_core::host_ui_transitions::settings_text_payload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_ui_transitions.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f32fcc37678ea1bfd21c347dff2985f082de3a3635c1d95d3afcb6408435a6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::command_refine::ids_outside_subtree (cognitive 20): op_editor_core::command_refine::ids_outside_subtree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (10 pts) (nesting depth added 8). Of this number, 10 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_refine.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4539ae875b10e0f7cfe3ffa4529c553faffb0ada50ce1d65e66add69b250551b"}},{"ruleId":"D2","level":"warning","message":{"text":"AIChatPlaceholder::footer_hover_at (cognitive 20): AIChatPlaceholder::footer_hover_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e34e57cc635d1f550356779cd2b6848cb1b493977aacfed5fc983dedc3b760c"}},{"ruleId":"D2","level":"warning","message":{"text":"DesignMdPanel::hit_test (cognitive 20): DesignMdPanel::hit_test has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (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":"crates/op-editor-ui/src/widgets/design_md_panel.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1d521162e8f8d369dda491524a5395bab5ebf03677646072cc798cb3349962"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingFontsPanel::hit_test (cognitive 20): MissingFontsPanel::hit_test has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/missing_fonts_panel.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b2165918abbefba2d4d0d0f56978190f044c67e84c0438d757b741c96f80f"}},{"ruleId":"D2","level":"warning","message":{"text":"TopBar::button_rect_with_measure (cognitive 20): TopBar::button_rect_with_measure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_geometry.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"13999e74477e3919766fe82f0ff87ff47e6ecc095ad8f33501f64c72ea7781ff"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_panel_header::paint_header_tabs (cognitive 20): op_editor_ui::widgets::ai_chat_panel_header::paint_header_tabs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 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":"crates/op-editor-ui/src/widgets/ai_chat_panel_header.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"be96b0276556024b5c5198ca05e96b1eb073cdcd76fc856f4919a0ad5ade5ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_fonts::hit_test (cognitive 20): op_editor_ui::widgets::agent_settings_fonts::hit_test has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (7 pts), loops 2, 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":"crates/op-editor-ui/src/widgets/agent_settings_fonts.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"271f692893d387d29f824eeaa328a1d696bd995c5fc58f4983231b21d1c1e030"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::scene_bounds::own_paint_corners (cognitive 20): op_editor_ui::scene_bounds::own_paint_corners has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/scene_bounds.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6657ea974de8f2bfe0ac5f114698a18f49750bb245476d54a83e50da3b57778"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::node_mapper::style_references::resolve_style_references (cognitive 20): op_figma::node_mapper::style_references::resolve_style_references has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/node_mapper/style_references.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd1d82584b73db7326e6167b8859be598a830a0a0e4385d9b0a5e6ecd457d9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::decode_vector_network_blob (cognitive 20): op_figma::vector_decoder::decode_vector_network_blob has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6be8f8bff39d5b619b4648dc1c1f815df7d471cd929e8fae60a1026d8c5cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::commit_diff_semantic::compute_commit_diff (cognitive 20): op_host_desktop::commit_diff_semantic::compute_commit_diff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/commit_diff_semantic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a7b0cb6b06666890e3730a1b08b20404d8a94308c4b6455c4970ccec9a30db"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::cursor_move_active_drag_tiers (cognitive 20): WidgetHostNative::cursor_move_active_drag_tiers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_panels.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dab5a543e5039efa9c0c8066af49a6a01f64ed29d37998427cd1aac69b237a"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_cursor_move_inner (cognitive 20): WidgetHostNative::apply_cursor_move_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 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":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"03151bdc52b140ff2e993f133c00e12387fe3bd5d4a1fc4a9caa612adc4d53c6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::chat_intent::turns::run_modify_turn_inner (cognitive 20): op_host_services::chat_intent::turns::run_modify_turn_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_intent/turns.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"302e0c12fda5bf94d3c7a54ed62392c6ee0b600d01381193d121d59bf9e69384"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::provider_probe_models::claude_initialize_query (cognitive 20): op_host_services::provider_probe_models::claude_initialize_query has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (5 pts), loops 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":"crates/op-host-services/src/provider_probe_models.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"19241fe312b7bec2b31128af2173b8f47ccc0e7beb779910ab5b89b0f18d79a4"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_import_locale_tiers (cognitive 20): WidgetHost::press_import_locale_tiers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (8 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":"crates/op-host-web/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e8d54bfe1a6ee34db6499c30d3ee84baad71b75a692b3c00dd197a0e5a4fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_release (cognitive 20): WidgetHost::apply_release has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/release_input.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4414ef258af8f657db9a09d01b495095977f02ca39f56053d10cd23864d074"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::web_fonts::collect_text_font_families (cognitive 20): op_host_web::web_fonts::collect_text_font_families has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_fonts.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75aae83380d4afab1acd8be7dcb351e1cfa33e596bd9844b28c785981a76af3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_grid::top_level_tokens (cognitive 20): op_html::mapper_grid::top_level_tokens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecf29cceeb0abfa86042e99e4465f7c42917e0e6ec187fde3502b035e4005a5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::resources_css_urls::rebase_stylesheet_urls (cognitive 20): op_html::resources_css_urls::rebase_stylesheet_urls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources_css_urls.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acab4de080a6f07a622bcbbc690576604088fbaa42807ca0f9338e7cf1fbf2d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::cascade_shared::split_top_level (cognitive 20): op_html::css::cascade_shared::split_top_level has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade_shared.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9269a74ff346dc79d5e063e2001d1ba8a7fc8ac7f5235ee6b02f66e0de7d48"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::cascade_parser::strip_comments (cognitive 20): op_html::css::cascade_parser::strip_comments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c614dfb45603093e9d93bb75ef1797ed50b7508c0bf68f384bb35026440827"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::codegen_plan_store_assembly::assemble_plan (cognitive 20): op_mcp::codegen_plan_store_assembly::assemble_plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store_assembly.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d584550254af0b975273d9f312fbfb5377e3c92c5d75ae18f9304a44e14e8194"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::section_headline::collect_headline (cognitive 20): op_orchestrator::section_headline::collect_headline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/section_headline.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"edefdbf2e26f0dad7baa91eb1ec0f63839e25d399e7e07e795c761969dbc1c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::wire_screen_navigation::best_tab_row_path::visit (cognitive 20): op_orchestrator::wire_screen_navigation::best_tab_row_path::visit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (4 pts), loops 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":"crates/op-orchestrator/src/wire_screen_navigation.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0476865ccc75af60d4d2ebf3570c2eaeba618d0daf3f16a3c98b056a35d9cd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_starved_row::collect_starved_rigid_row_fixes (cognitive 20): op_orchestrator::geometry_starved_row::collect_starved_rigid_row_fixes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_starved_row.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeaf5a68ba5cf86a1f47a71c5ab54abee3d131f0ac4f722d10f01d1d375fc5f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_interaction_backfill::interaction_backfill_facts (cognitive 20): op_orchestrator::geometry_interaction_backfill::interaction_backfill_facts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_interaction_backfill.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7cc828ef5dd88b815dac395fe9887db4ce7d9d2e3181dfa122c18a1a77a7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::vertical_flush_descendant (cognitive 20): op_orchestrator::cleanup_slide_padding::vertical_flush_descendant has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, 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":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda159cca6fc442c5685c65f2d58b05455032caedfc5e494c121966a59dbc992"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::wrapper_content_edge (cognitive 20): op_orchestrator::cleanup_slide_padding::wrapper_content_edge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, match/switch 1 (3 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":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1e699e5f6cb91da8b22c3c4b85efedb0ed595b1222e98bb99852a4330d5f32"}},{"ruleId":"D2","level":"warning","message":{"text":"op_pen_loader::style_payload::fill_fallback_color (cognitive 20): op_pen_loader::style_payload::fill_fallback_color has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/style_payload.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"484064db403d51c8c5b30df4955fd322dafc12782b004f75a9ee4e217c86b487"}},{"ruleId":"D2","level":"warning","message":{"text":"op_render_export::scene_painter::ensure_images_decoded (cognitive 20): op_render_export::scene_painter::ensure_images_decoded has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-render-export/src/scene_painter.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0263bc8d2b86ddb7e5901cfaab489588d95e9ab0828f68c971045ae66de2066e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_smoke::audit_rubric::interactivity_report (cognitive 20): op_smoke::audit_rubric::interactivity_report has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"crates/op-smoke/src/audit_rubric.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dfdf816a2424766ca250bd8e1088367de397b0dfc3ddd8e98bcc77b10140e5"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-rate-rules.verify_rules (cognitive 20): verify-rate-rules.verify_rules has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 5, loops 2, ternaries 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":"deploy/collab-relay-edge/verify-rate-rules.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b60da3df1548051b76f36ff4c78d8cd7b524e2dbef620738e9eb6b08973e074"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-extractor.shapeToPathData (cognitive 20): snapshot-extractor.shapeToPathData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a544bed1f82e846d25c6fd6d53a590e8cad517a19dd871c41b4099ff32faf93"}},{"ruleId":"D2","level":"warning","message":{"text":"opCkInit::textFirstBaseline (cognitive 20): opCkInit::textFirstBaseline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, ternaries 4, loops 1 (2 pts) (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":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0549a97741d39efd9a1869c40342ed3298145da90b243578a00705413bf3c203"}},{"ruleId":"D2","level":"warning","message":{"text":"op_acp::transport::read_frame_with_limit (cognitive 19): op_acp::transport::read_frame_with_limit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-acp/src/transport.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b013b57bd908b2c2cc5ce14ada545ab6072d5dcc4062ffed59ec113dadda97f1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::parser::extract_typography (cognitive 19): op_ai_skills::style_guide::parser::extract_typography has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 2, match/switch 1 (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":"crates/op-ai-skills/src/style_guide/parser.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3a302d830e5fe61451f3b0a40d386e607deff54b9721971df909ca0ca38db4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::key_aesthetics::signature_recipes (cognitive 19): op_ai_skills::style_guide::key_aesthetics::signature_recipes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/key_aesthetics.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ed54136dadf86d610ba25224598e833c9d06fb88c84534a9ac0cbfa3b1b90a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::backoff::send_with_backoff (cognitive 19): op_chat_agent::backoff::send_with_backoff has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/backoff.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e0dd12fdc81999c4b05976960ddd53a112d1768acfefbea61ce2b9540d14ca"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab::guest::validate_welcome (cognitive 19): op_collab::guest::validate_welcome has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"47253df54eb1edc30702dfd685ac179fa9f24e9393b9c19c4cc572205d551f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabRuntime::route_guest_output_inner (cognitive 19): CollabRuntime::route_guest_output_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (8 pts), boolean chains 1, loops 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":"crates/op-collab-host/src/runtime/effects.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e66511a4c4bfdad4a6b721b2c9f44cb8139ffd03e3272d912bd4a14a06623ba"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_host::runtime::network::guest::run_inner (cognitive 19): op_collab_host::runtime::network::guest::run_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/guest.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad81223cd868e77185b069a38acc7c7a28e89b3ff7fcdf84679f9524178d7078"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_smoke::fault_owner::retry_exactly_once (cognitive 19): op_collab_smoke::fault_owner::retry_exactly_once has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 8, match/switch 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":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e80ad57237cc3c31acd99219466636575a8a063ca45c781e61323c4b3a7abe4"}},{"ruleId":"D2","level":"warning","message":{"text":"TransportConfig::validate (cognitive 19): TransportConfig::validate has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 pts), loops 1 (nesting depth added 1). 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":"crates/op-collab-transport/src/config.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e7e3267a915f2a2585c6bbe09f630690c624d22617859839f92defec3c2c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_transport::discovery_bonjour::interface_advertisements (cognitive 19): op_collab_transport::discovery_bonjour::interface_advertisements has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/discovery_bonjour.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fe15d54ba3701bfd394c478416fb1c72f23578e65da753031e6f8dc92f47bb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::variables_resolve::roots_have_tokens::node_has_token (cognitive 19): op_editor_core::variables_resolve::roots_have_tokens::node_has_token has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/variables_resolve.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3a3aa51cd8827dda10db0142f4355a521e2148a13193aa818241b610375eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::prompt_center_catalog::parse_prompt_catalogue (cognitive 19): op_editor_core::prompt_center_catalog::parse_prompt_catalogue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/prompt_center_catalog.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d46929189f7f8707e4d3672096aa263542cc5d14c6e24a0e913d967ade0bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::align::parent_aggregate_bounds (cognitive 19): op_editor_core::align::parent_aggregate_bounds 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":"crates/op-editor-core/src/align.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3616afa202454427b6d0e50fc1af4c99e3af30fc34e36238aeb3de8c9c1da54"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::instance_override::resolve_instance_display_node (cognitive 19): op_editor_core::instance_override::resolve_instance_display_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfd376f5e4c59494045d9aff30bc3ac63af639239beb21f52c50953b09f1261"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentBrowserPanel::filtered (cognitive 19): ComponentBrowserPanel::filtered has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda4db85fce621464955fd23ad2016e5cfdaea24c98c240c9375b76953647164"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_images_parts::paint_profile_field (cognitive 19): op_editor_ui::widgets::agent_settings_images_parts::paint_profile_field has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"59508163932bb9d965c551c6cd1a549be822f7e26e5bb6eb1ded080cf5e98034"}},{"ruleId":"D2","level":"warning","message":{"text":"McpLiveServer::pump (cognitive 19): McpLiveServer::pump has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_live.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d35fcc586b404c1583e3a2d71d14e82a608884abd4f0917056fe4f11f6289cb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::cli_modes::run_cli_mode (cognitive 19): op_host_services::cli_modes::run_cli_mode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/op-host-services/src/cli_modes.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfaa5fd736ae43a6b4ae9567cbc80d6b8ac35d4e8cecc9a67d3e8358b4d2137"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_chat_standard::apply_request_snapshot (cognitive 19): op_host_services::web_chat_standard::apply_request_snapshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_chat_standard.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c518ba090b47596bbb10f6a9834de3beb7fb98b51b52cd708fa2e04d5696d153"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_static::handle_static_request (cognitive 19): op_host_services::web_static::handle_static_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_static.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b85021eefc8161026a1bb80a102e01f58da356f0fb1935c1b77a73f7e59c02"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_property_panel_tier (cognitive 19): WidgetHost::press_property_panel_tier has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_property_tiers.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"912302bc77206112e295a6e0b95720f6163487a6f0655c718ce10a45c89822fb"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_wheel_with_canvas_delta (cognitive 19): WidgetHost::apply_wheel_with_canvas_delta has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/wheel_pan.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a476b3ef75c495e4178eb963fc708270b29ad26db2bbc78d0ecb10f9d6120f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::dom_io::drop_entries::collect_files (cognitive 19): op_host_web::dom_io::drop_entries::collect_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/drop_entries.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9b07383c7e6a35c32eef0d804312a8b82a094e5b62beb65be774e27fce5aed"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetParser::at_block (cognitive 19): SheetParser::at_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), match/switch 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":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ad302996066f4b1b654e922278ef322d4eaf6f2cca4030cfc366c2e32d70d4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::resources::embed_fills (cognitive 19): op_html::resources::embed_fills has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6dc87868b4b231b55cc47215f0ac5ac93cf827f7ca768bad999e723f50713c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::declarations::parse_declarations (cognitive 19): op_html::css::declarations::parse_declarations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd7fd3007736ae5473cd70b29f6c1df4b59dfa4efc295101644f3f38490ffd9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::declaration_syntax::strip_comments (cognitive 19): op_html::css::declaration_syntax::strip_comments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16529c59f56494082208e763a25550ffefc0aa3911861aeed5c0964bbe26ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_opmerge::collect (cognitive 19): op_opmerge::collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (8 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-opmerge/src/lib.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d42849171281a2e26a46febefaf63a3114ba7a2d327b6fc9445acca47e97a5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::abandoned_duplicate_roots::remove_abandoned_duplicate_roots (cognitive 19): op_orchestrator::abandoned_duplicate_roots::remove_abandoned_duplicate_roots has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/abandoned_duplicate_roots.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1f50ebe1f471a0621f65b5d98496264a5f798d09098f33e66ead6d1920533"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_grow_fit_fixes::collect_grow_to_fit_fixes (cognitive 19): op_orchestrator::geometry_grow_fit_fixes::collect_grow_to_fit_fixes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_grow_fit_fixes.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a10be999ebbb59e84c50c440e1313f0189485b1b6da3114736f28eb719a6b54"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::prompt_components::component_category (cognitive 19): op_orchestrator::prompt_components::component_category has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/prompt_components.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d885aabc773be3fc845a4f082b804acff66a1f807196182e0b27cdae857ae02d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_buried_overlay::collect_buried_overlay_fixes (cognitive 19): op_orchestrator::geometry_buried_overlay::collect_buried_overlay_fixes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_buried_overlay.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a3c1065593b4adba74c49b8624957baafbd057a54cd6360afa2e0e790feefa"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_validation::table_columns_exceed_width (cognitive 19): op_orchestrator::geometry_validation::table_columns_exceed_width has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_validation.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d220bc6df6309e9eeaeb726ce6173f61d849ec06f2b76ce78363aa1102ed5e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_post_pass::contrast::fix_section_alternation (cognitive 19): op_orchestrator::role_post_pass::contrast::fix_section_alternation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/contrast.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bb4ce21bed23fd37e19af1aeaa8eb5321e960db3e420f85d8a75488abc8b14"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::avatar_repair::avatar_slot_repair (cognitive 19): op_orchestrator::avatar_repair::avatar_slot_repair has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 2 (3 pts) (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":"crates/op-orchestrator/src/avatar_repair.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b9da345b0570817b740a3c49764eadffd8f7481c9268920ae2daefc5f0822e"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewSession::pinned_nav_candidate (cognitive 19): PreviewSession::pinned_nav_candidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d01888a4716be68ff09ca34a15452ccf59db3bd5459cdf2bea59f686157802"}},{"ruleId":"D2","level":"warning","message":{"text":"op_process_io::process_tree::terminate_process_tree (cognitive 19): op_process_io::process_tree::terminate_process_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-process-io/src/process_tree.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ecadd76fc5a1afa335752235af6d5f475aa64a611eb44c7b0b842a464eaf33"}},{"ruleId":"D2","level":"warning","message":{"text":"run_matrix.aggregate (cognitive 19): run_matrix.aggregate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (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":"scripts/ab-v9/run_matrix.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8123e2dbeca4a7a34964f2884a8ea6cd632e4ae9abbfc61db7aebdd34864123"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web.__wbg_load (cognitive 19): op_host_web.__wbg_load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1 (3 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"98efcf000bf82918ffb8a7f9011074182fa42c6368dc4aee5f764ae979dc6594"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web.__wbg_load (cognitive 19): op_host_web.__wbg_load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1 (3 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac451d2cca5b1cc35a6df9b451552dabd042ff2b7fd933f1f467916d552705c8"}},{"ruleId":"D2","level":"warning","message":{"text":"popup.onDownload (cognitive 19): popup.onDownload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, ternaries 1 (3 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fefed20effef17bff3aa641ac49a344944a1a36284d0fec963781df5d2605a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::shapeToPathData (cognitive 19): (anonymous)::shapeToPathData has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cf1dab765a4a30cbc837961386fd8657220b0f6f9b1c90a18303fe4ba1d7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::design_agent_tools::quality_scans::scan_header_icon_row_issues::walk (cognitive 18): op_chat_agent::design_agent_tools::quality_scans::scan_header_icon_row_issues::walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools/quality_scans.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a524b7440c5b1c484ca160db9cb653d6ae858a87ecc72d1b291e3bde22d6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::design_agent_tools::root_seed::seed_root_frame_if_needed (cognitive 18): op_chat_agent::design_agent_tools::root_seed::seed_root_frame_if_needed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, 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":"crates/op-chat-agent/src/design_agent_tools/root_seed.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1663360c301b2a84c181edecefc6e5cc6d15570eca1b18ab63ab5b1ee35a3f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnerSessionCore::handle_undo_request (cognitive 18): OwnerSessionCore::handle_undo_request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/session_undo.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa1645911bb6efe7c6c1d49de454d5d34bc61ebb24efc89d5854f0366de01f"}},{"ruleId":"D2","level":"warning","message":{"text":"SignerConfig::validate (cognitive 18): SignerConfig::validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-hsm/src/config.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"478e1f2c64fbe2f05cd9176061caeadcd41caa25a7cafa3bc79eae0e437b0028"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_smoke::guest::run (cognitive 18): op_collab_smoke::guest::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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":"crates/op-collab-smoke/src/guest.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1950db7f9ea09b426620fbea70b068c908b9110ef03702a71e4f27a71490f24"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::typography::collect_low_contrast (cognitive 18): op_design_lint::detectors::typography::collect_low_contrast has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/typography.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"276bb0998503330a6f1f5e67a42713a1a822302346e6cc27a4cb6258e484e204"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::cmd_batch_insert_with_allocator (cognitive 18): EditorState::cmd_batch_insert_with_allocator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node/state_ops.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cc27733447584ee22fd3eba6c457608ff371f9245b32bab9c7e97a38507ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::rename_commit (cognitive 18): EditorState::rename_commit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/rename.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef6507c7b060e560512153b56dca266fe8ba02e0c1bb1dc8298e81781501ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::mutators::duplicate_in_children_with_allocator (cognitive 18): op_editor_core::mutators::duplicate_in_children_with_allocator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/mutators.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c2f3b435b13a0290f76189bce402d96a874f01b5b3b6c98aa32591d34412cd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::xml::find_matching_close (cognitive 18): op_editor_core::svg_import::xml::find_matching_close has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), 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":"crates/op-editor-core/src/svg_import/xml.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57bcf039196f7fc56e6867b66d942787c83df4555ee094bbe7fbf912c828940"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::paint_ready (cognitive 18): GitPanel::paint_ready has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), 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":"crates/op-editor-ui/src/widgets/git_panel_ready.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3f17be53e512baa78ec00b4087a058cf05e369736130fbe74b88a0ab6d0eea"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerPanel::drop_target_at (cognitive 18): LayerPanel::drop_target_at has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel_hit.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2268c67e51809dff264453b2ab2cf894b4aed635a268432833d03fdf045845c7"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_builtin::paint_compact_builtin_agent_card (cognitive 18): op_editor_ui::widgets::agent_settings_builtin::paint_compact_builtin_agent_card has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"7234dc4f6bbfcaa1a80bc7ea4a28743b06618758261a17cc56e981f391ac6ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_images::paint::paint_search_header (cognitive 18): op_editor_ui::widgets::agent_settings_images::paint::paint_search_header has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae0de717d84ebdbc4eb7a8d3c63981bd4ab9f5d4ef8d61c143a0d3d689a9d19"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_images::paint::paint_advanced (cognitive 18): op_editor_ui::widgets::agent_settings_images::paint::paint_advanced has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00bf5c596a16d43ee8d2a39555e0d752a564b29c5acf8b46a729ce6b84feff9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_richtext::wrap_spans (cognitive 18): op_editor_ui::widgets::ai_chat_transcript_richtext::wrap_spans has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 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":"crates/op-editor-ui/src/widgets/ai_chat_transcript_richtext.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d11ff91ee1b61ea964b6d3ec21e2da6aa675fab2ac9ef0bbb4acf75f601256a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::svg_export::emit_node (cognitive 18): op_editor_ui::svg_export::emit_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/svg_export.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75971f843b6e7a0ed96a1228fb480176a33439d10f383908e9b34cbf2fce0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_compositing::paint_picker (cognitive 18): op_editor_ui::widgets::property_panel_compositing::paint_picker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_compositing.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55887bb64131a318ff2fd4ec96f71e30c60058fd9ce5a27f9c47738f040ea11"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_agent_cursor::cursor_sprites_with_idle_anchor (cognitive 18): op_editor_ui::widgets::canvas_agent_cursor::cursor_sprites_with_idle_anchor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_agent_cursor.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e3b0e7a0f3ec77c02e3c405fbf422f455c6f245401060366552113dc971f78"}},{"ruleId":"D2","level":"warning","message":{"text":"op_engine_ffi::render::paint_into_canvas (cognitive 18): op_engine_ffi::render::paint_into_canvas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/render.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"157775dac5ad3b8fa98fe52485ffbed370e3ff8a5112cfbbe78120b8ad9bbddc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::assignment::guessed_mapping_is_implausible (cognitive 18): op_figma::instance::assignment::guessed_mapping_is_implausible has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2, match/switch 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"055fd8d4a436fba2c92404671537272cf96a9c22f11b49dba1fe233f3ce84821"}},{"ruleId":"D2","level":"warning","message":{"text":"GitRepo::merge_branch_isolated (cognitive 18): GitRepo::merge_branch_isolated has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-git/src/merge.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a51a5a20bdd61130a4e824c629ed0ca2683c99efb366632e4d39463199a296"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::image_decode_host::decode_worker (cognitive 18): op_host_desktop::image_decode_host::decode_worker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/image_decode_host.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c505286b8b093b3d89ce2af4ddb1b5246e52d5e50b8be387d0438e399f4db1"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeBackend::draw_text (cognitive 18): NativeBackend::draw_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia/text.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"862173ec30442fe3d7ae8a165ad6c0dce1c975d5ced7a5bf096b3643935a5ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_path_anchor_drag_move (cognitive 18): WidgetHostNative::apply_path_anchor_drag_move has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/pen_press.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"05294b596156cff71fcd820ea3b696c74857e708d10b5f2420a48f1cfe3dcda4"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_rail_overlay_tiers (cognitive 18): WidgetHostNative::press_rail_overlay_tiers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (6 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a576cc55316f5b039bcd52d7e35b693e698b29fefee1d329f52e96e93d85f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::preview_dispatch_move_id (cognitive 18): WidgetHostNative::preview_dispatch_move_id has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/preview_input.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca78f7392ea3fe6da2a8457cec775c6de5081998b7b5b831365267a044527e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::paint_workspace_strip (cognitive 18): WidgetHostNative::paint_workspace_strip has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/workspace_paint.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9afe2986ef614ca4149baef1c6b9105540c825d261ce4786e4a5b4f18c3c0f0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::export_html_structured::unexpressible (cognitive 18): op_host_services::export_html_structured::unexpressible has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_html_structured.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"626553e9f050bd958b9d34f558df6504b7e69ab116cb92f6930320051456b612"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::profile_avatar_fetch::fetch_profile_avatar (cognitive 18): op_host_services::profile_avatar_fetch::fetch_profile_avatar has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/profile_avatar_fetch.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3205f190e14cf90684c1a00b71d1a98fee7421d71e542cb09143130671a04c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"CkInner::repaint (cognitive 18): CkInner::repaint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/inner.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f4d39c6fe6f1034e602163b7928d2f2752e9a2f3a8e890cd503cfa5d05873"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_git_backspace (cognitive 18): WidgetHost::apply_git_backspace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 1 (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":"crates/op-host-web/src/widget_host/keyboard_git.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47fb5eac8c8cde21854422bb3bbcb71de966635686f8d85bcf85b6fa6f5e402"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::live_sync_glue::push_document_if_changed (cognitive 18): op_host_web::live_sync_glue::push_document_if_changed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync_glue.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e0162303145e8e53323308c24cb239275f5fe298ed3d6b70564a783fd5c7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::web_auth_sync::apply_login_status (cognitive 18): op_host_web::web_auth_sync::apply_login_status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 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":"crates/op-host-web/src/web_auth_sync.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0404b437ec35c0c55c995c28cc53956645db6a8af9632fd6ca73ea981b695ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_number (cognitive 18): Parser::parse_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/length.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca9aef7b87ee90ff09490a5ed6cb4940c671e6ec39512d763907bbc1d0cbaa2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper::apply_base_style_with_box (cognitive 18): op_html::mapper::apply_base_style_with_box has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"38546fa787722babb4c120ffef92b5c4c22c73590ec7e6ae7c00866bc5c5e9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::special_image::apply_intrinsic_axes (cognitive 18): op_html::special_image::apply_intrinsic_axes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98b13ea7784622e4593054d49c4854a9012ca7acb3b5d06a84b35db2218cb88"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_margin::wrap_margins (cognitive 18): op_html::mapper_margin::wrap_margins has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_margin.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6e4e1bbf45f9eac464c7180bafe45daee37f8bc6e845a6f8673275b7dacbb4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_grid_place::pack_rows (cognitive 18): op_html::mapper_grid_place::pack_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, 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":"crates/op-html/src/mapper_grid_place.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"495c737c848dd05cf6272549a2f6fb65c0dc4eb2f456eed6cd7ce5811e4a4cca"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::cascade_parser::selects_marker_pseudo (cognitive 18): op_html::css::cascade_parser::selects_marker_pseudo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7de3e369629ea6118307d3985632c62a1bffbd9e51b233a85ae70cf76a79713"}},{"ruleId":"D2","level":"warning","message":{"text":"op_image_enrich::net::fetch::fetch_judged_wikimedia (cognitive 18): op_image_enrich::net::fetch::fetch_judged_wikimedia has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 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":"crates/op-image-enrich/src/net/fetch.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7634af7e17437a5713182b5abc69e1000753ed16d5bfa0892a0be46a3fffb0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchAllUniqueProperties::call (cognitive 18): SearchAllUniqueProperties::call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), match/switch 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/style_ops_tools.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff415f6bf835e4dd2d0c2f17aed44c9dcd8010b918d9d4e4ea17eafc4d96f62"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_wire::parse_string (cognitive 18): op_mcp::batch_design_wire::parse_string has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_wire.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"48afc60b8593c7674b96e3ace8dd666440f686e6010dc369f7b7ac659829a6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_infer::resolve_node_role (cognitive 18): op_orchestrator::role_infer::resolve_node_role has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_infer.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"78df65eeca099eadf18a796a8adc9149861f19c3738d0cd0a439bd3dc2ad2557"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_diagnostics_collect::collect_rail_width_collapse_diagnostics_with_context (cognitive 18): op_orchestrator::geometry_diagnostics_collect::collect_rail_width_collapse_diagnostics_with_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, 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":"crates/op-orchestrator/src/geometry_diagnostics_collect.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"012c4d4aac8ff311ecf0536684b501dc672cd42efc856f2351c87b330b6ee6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_row_fixes::table_rows (cognitive 18): op_orchestrator::geometry_row_fixes::table_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b476e00f4264673794c33fc8bcb26ac2b3663cdd2ac3b7d06f0926cbf5cb38"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan_continuation_contract::apply (cognitive 18): op_orchestrator::plan_continuation_contract::apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_continuation_contract.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91e40a6ae2f28f7c1220f1cbebe763576c421569e7f4bbf035ede927a5d0dae"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::loop_finalize::ensure_text_fill_forest::walk (cognitive 18): op_orchestrator::loop_finalize::ensure_text_fill_forest::walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 pts), boolean chains 2, 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":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2130ce5c45523e917b4a72c76eed782ae941496d8827a6b2e85a511d8290848"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::tree_heuristics_fills::inject_nav_surface_for_section (cognitive 18): op_orchestrator::tree_heuristics_fills::inject_nav_surface_for_section has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/tree_heuristics_fills.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8161fe51935f58379b4e3e29d0b96ff3da18f3464b7e801ab78e4ecaf34c903a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_scale_ops::collect_scale_ops (cognitive 18): op_orchestrator::geometry_scale_ops::collect_scale_ops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_scale_ops.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"20922384f996014e36e5c38396d1aa57049018d45bd960f21348f7751cf159b0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::validation_fixes_apply::collect_node (cognitive 18): op_orchestrator::validation_fixes_apply::collect_node has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 12 (15 pts), loops 1 (2 pts), if/else 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd05052d4590c4d5bd108424c02da23820f81c6ce1daf8a95db46094e2e755e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_post_pass::micro_surface_radius::is_compact_capsule_surface (cognitive 18): op_orchestrator::role_post_pass::micro_surface_radius::is_compact_capsule_surface has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts) (nesting depth added 1). 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":"crates/op-orchestrator/src/role_post_pass/micro_surface_radius.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ce6857909952a44828b59c289c7696f4192a5e9da04f9751ec7927e78909fc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan::explicit_slide_count (cognitive 18): op_orchestrator::plan::explicit_slide_count has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68c6b90f040d308ab7b19df410ca126d8ac66a8993fea7a012e2034e7e34142"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::chip_repair::adopt_in_value (cognitive 18): op_orchestrator::chip_repair::adopt_in_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/chip_repair.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"016b8d3f153c98c8852e06fbb6ff088e42d56228c8e26425b66821915411a0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_post_pass::mobile_search_header::normalize_nested_search_shell (cognitive 18): op_orchestrator::role_post_pass::mobile_search_header::normalize_nested_search_shell has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/mobile_search_header.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f900e23e175905559cf4f9dbf3858da5c5e358f4cab992ed113c120c470d3556"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan_fallback_card::explicit_card_count (cognitive 18): op_orchestrator::plan_fallback_card::explicit_card_count has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_fallback_card.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3941f78ecd260c6d61a0a24f8d72b21b53bc4cd690ac8b134c70a428a3b71f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::prompt_design_tokens::extract_explicit_design_tokens (cognitive 18): op_orchestrator::prompt_design_tokens::extract_explicit_design_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/prompt_design_tokens.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f357a71ec49eaca8563451041c2b60256e143d03da3135bd6b0a4a60331759"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::radial_repair_preinsert_normalize::wrap_arc_layers (cognitive 18): op_orchestrator::radial_repair_preinsert_normalize::wrap_arc_layers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), 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":"crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68eaa61ef8c03f78bf60f25b92d49476f2abf729dc696609c3471f7aed8abe1"}},{"ruleId":"D2","level":"warning","message":{"text":"digest-op-auth-tree.tree_digest (cognitive 18): digest-op-auth-tree.tree_digest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/digest-op-auth-tree.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"83acafc488eb804265d6bf7b34dcec7cd7c81383864a5bfb77fe36314fe4499d"}},{"ruleId":"D2","level":"warning","message":{"text":"export-i18n-catalogs.parse_locale_source (cognitive 18): export-i18n-catalogs.parse_locale_source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/export-i18n-catalogs.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deccb5a7ba020e8f9bcd1dcbd74b562bee03478604c21517c2177f28aaa803c"}},{"ruleId":"D2","level":"warning","message":{"text":"merge-settings-i18n.main (cognitive 18): merge-settings-i18n.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), boolean chains 2 (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":"tools/merge-settings-i18n.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b59c09d0489616c78337073b2389d734e47f265c580c5fc2b78ab90dbd7e98"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-extractor.buildTextLines (cognitive 18): snapshot-extractor.buildTextLines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee4b1fe850a552a0b52f79d5f3270fc03190610c9bf2ddd54f6a48ac21d2540"}},{"ruleId":"D2","level":"warning","message":{"text":"client.readBoundedDesignResponse (cognitive 18): client.readBoundedDesignResponse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/client.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92454f45644d7d990fe9a359a079175ea6c4c1bd144e3f8cad1e6912305b483"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::buildTextLines (cognitive 18): (anonymous)::buildTextLines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b71c66e70a77e8789c6413fb2e699cfd3636990911e87ea64d26f2b8e4db368"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabJwksCache::verification_key_locked (cognitive 17): CollabJwksCache::verification_key_locked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/collab_jwks_cache.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d8d9649fe491797c984c0394659fbe7b0b8bb785217fe4118d50a8c9b96626"}},{"ruleId":"D2","level":"warning","message":{"text":"op_builtin_model_discovery::parse_catalog (cognitive 17): op_builtin_model_discovery::parse_catalog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1, 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":"crates/op-builtin-model-discovery/src/lib.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040d7f8a446703a36fcf5411da5f0392d958deb3bb86235a8a8f27993c1d2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::design_agent_tools::quality_scans::scan_empty_shells::walk (cognitive 17): op_chat_agent::design_agent_tools::quality_scans::scan_empty_shells::walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, 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":"crates/op-chat-agent/src/design_agent_tools/quality_scans.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f35dd389d869b6e2b4a765e7d976d9523ce5e36a1949116dd6ea832f0deb710"}},{"ruleId":"D2","level":"warning","message":{"text":"op_chat_agent::design_agent_diagnostics::scan_container_intent (cognitive 17): op_chat_agent::design_agent_diagnostics::scan_container_intent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_diagnostics.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d508742a514d9aae1335410182f32078d796e95facb37019d4c7f61c03288015"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenPipeline::apply_plan (cognitive 17): CodegenPipeline::apply_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/ai/pipeline.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df7c36a9d7dbef7e2f901bd81be46f937f80fc8298aebd1cc78fdac16e5bf48"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestSessionCore::finalize_install (cognitive 17): GuestSessionCore::finalize_install has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (4 pts), match/switch 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":"crates/op-collab/src/guest.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b375a895a124a871affac4da0393977a80dfdb93f5a880ae52094ebb20c70d0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab::codec::validate_presence (cognitive 17): op_collab::codec::validate_presence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/codec.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4dd5fdea2eb0c3a32932896d01eb9aea7e8ddf1bb2df00077e2004dc8a3708"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestRelayRuntime::start (cognitive 17): GuestRelayRuntime::start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3 (5 pts), loops 1 (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":"crates/op-collab-host/src/runtime/relay/guest_runtime.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7520bbaba1d473f242f4487c22ce88dd389c1aadc5d772cda51c56c2aaf88f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabRuntime::connection_closed (cognitive 17): CollabRuntime::connection_closed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/effects.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"16945e907f893349b20f0d5728af224d33ccdc42b7821747cd9fcf9a76af842b"}},{"ruleId":"D2","level":"warning","message":{"text":"CollabGatePolicy::check (cognitive 17): CollabGatePolicy::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/collab_gate.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbdf2683775e03d8c31db385615a7775ab54218917472cdd7d70421d3909019"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::cmd_insert_authored_subtree_with_root_policy (cognitive 17): EditorState::cmd_insert_authored_subtree_with_root_policy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 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":"crates/op-editor-core/src/command_authored_subtree.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccb6abee7cebc5f16cbbda76b679f619ae275ed4925efdd1ed2e5e910b345ce"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::cmd_update_node (cognitive 17): EditorState::cmd_update_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (17 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":"crates/op-editor-core/src/command_node/state_ops.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"515bbd4b82de000b0a4a0e5d7f729d7d22d9441a3d46304fc9e3c0be44eef88d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::text_edit_caret_vertical (cognitive 17): EditorState::text_edit_caret_vertical has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_edit.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a557a9c0b903b0e4522879d91048e9149246dffe726568e5f4e595912a185df9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::scene_template_palette::collect_fill_colors (cognitive 17): op_editor_core::scene_template_palette::collect_fill_colors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/scene_template_palette.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f55531e8bb1afbe6ac2fc2858c1d2f42ae42cef0fcbc0f5f40c64f1684fc5f0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::svg_import::lexer::parse_svg_elements (cognitive 17): op_editor_core::svg_import::lexer::parse_svg_elements has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa437d08893038e36d1bc96049830ec7b5fb059815c5b9eefe63412e789c73"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::command_style_replace::apply_replacement (cognitive 17): op_editor_core::command_style_replace::apply_replacement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba135033c86b3fda3bd8b3828766fa2935f4cb335f6574c00f97a761414c597"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::agent_indicators::smooth_overdue_reveal_burst (cognitive 17): op_editor_core::agent_indicators::smooth_overdue_reveal_burst has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/op-editor-core/src/agent_indicators.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c810958e81965f45b9bded84fd566f8905c98e702c9c435df59107ffa07a9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_host_core::codegen_runtime_state::pump_codegen_state (cognitive 17): op_editor_host_core::codegen_runtime_state::pump_codegen_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 pts), 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":"crates/op-editor-host-core/src/codegen_runtime_state.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d262d5bcd5ddf675411d484440ebe301ce59f7700705e4f06c62419a411a83"}},{"ruleId":"D2","level":"warning","message":{"text":"MobileDock::paint (cognitive 17): MobileDock::paint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/mobile_chrome.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e334fb96165857fd47c607e6b9ed886adb54920d8765d690d810700f625648"}},{"ruleId":"D2","level":"warning","message":{"text":"SlidesPanelTabs::layout_rects (cognitive 17): SlidesPanelTabs::layout_rects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/slides_panel_tabs.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4f83526c6998dbafdc802c4928f67ed21e1071b4b88276274d4d3483deb2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::drag_flow::flex_insert_preview (cognitive 17): op_editor_ui::widgets::drag_flow::flex_insert_preview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/drag_flow.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bbc61d3925fae42465bda9d39d7db2f0ce7e0337fb99f2c0952d52d8298016"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_dispatch::apply_instance_lifecycle_action (cognitive 17): op_editor_ui::widgets::property_panel_dispatch::apply_instance_lifecycle_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_dispatch.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d142ae056732a70b1386f1cdf8548a93532888c33e6ac4ccd280af050feb1672"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_tools::paint_tool_card (cognitive 17): op_editor_ui::widgets::ai_chat_transcript_tools::paint_tool_card has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1 (2 pts) (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":"crates/op-editor-ui/src/widgets/ai_chat_transcript_tools.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e93c6dd9db2aefe6e1dd243f3e7119823afee7dda3a8062ce230d22c729a31"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::login_modal_paint::paint_primary_action (cognitive 17): op_editor_ui::widgets::login_modal_paint::paint_primary_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (17 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/login_modal_paint.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"761316aa8a9824db2c7347ed25049b82645277afbc56f936465e3541583d1ad0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::property_panel_image_popovers::paint_search_popover (cognitive 17): op_editor_ui::widgets::property_panel_image_popovers::paint_search_popover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d0e9bdcdb6745d79c05638f810cc5aae0fed0110fb5a94d66ee499c0dc424e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit (cognitive 17): op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f989af12fbcf1e50e4c85f361e38a0a9335cb847bf2e285c283301c7dae08ce"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::decode_figma_vector_path (cognitive 17): op_figma::vector_decoder::decode_figma_vector_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 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":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c4cb9b8c925207714b6117df80571570725ff86ae52aca44965b78d913bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::fingerprint::assign (cognitive 17): op_figma::instance::fingerprint::assign has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/fingerprint.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1249c0a56ebfb3073008383a41fb71ba2746b62f1ab1e569bea89b84cd2047"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::node_mapper::figma_node_changes_to_pen_nodes (cognitive 17): op_figma::node_mapper::figma_node_changes_to_pen_nodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/node_mapper.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d6ddc4a3f4b2bab84faff0209ee06ca055f9cc4c021b5aa4138c4fcc708b94"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::instance::assignment::seed_assignments_from_instances (cognitive 17): op_figma::instance::assignment::seed_assignments_from_instances has cognitive complexity 17 (threshold 15). Drivers by points: if/else 20 (50 pts), loops 10 (24 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (op_figma::instance::assignment::seed_assignments_from_instances::collect, op_figma::instance::assignment::seed_assignments_from_instances::collect_geom) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09623f69b65a14d29a5f2c39386135c29a8880fb69087de223a6c9d22d12fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::mcp_integrations::update_zcode_config (cognitive 17): op_host_desktop::mcp_integrations::update_zcode_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7de716149a0a61dfdc90ec4e22fdab4d1dc887ccd2efc7ce8cb9252fbfa418"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::sub_agent_session::pump_sub_agents (cognitive 17): op_host_desktop::sub_agent_session::pump_sub_agents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/sub_agent_session.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f586c50457b0828474f88e1ce511fec504d1b88177f310b528bc02e435c6397c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::render_cli::prefetch_remote_images (cognitive 17): op_host_desktop::render_cli::prefetch_remote_images has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4, boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (collect). 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":"crates/op-host-desktop/src/render_cli.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff65d7d76ac19d0c00a6da5ec46dc645f517d9259051609b95dff2116dcb98b4"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_canvas_node_press (cognitive 17): WidgetHostNative::apply_canvas_node_press has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/canvas_select_drag.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf145f277f85ccda9305378c9389f805d32783db786bb65e0a27fd3890305a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::apply_click (cognitive 17): WidgetHostNative::apply_click has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/click.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5987aeaee636c4f91e0e2f9182b576ced04b0f97a9a03f31016f8ca7426bdf8e"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::press_variable_value_cell (cognitive 17): WidgetHostNative::press_variable_value_cell has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (7 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5b86a17512d97d2053c981ff5de00b7f00244f2b5ab84b5256d8eac3affb58"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::emit (cognitive 17): Emitter::emit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_pptx.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b00dd83fa156f1fa2a73a729b07903b2dcf8d9f40def8ec2b20b6e3a6e1a329"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::design_md_evidence_normalize::normalize_design_color_evidence (cognitive 17): op_host_services::design_md_evidence_normalize::normalize_design_color_evidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence_normalize.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dad8cd2b621c29639bd6567d177349655075bf8d82c0aead85d9ad9f00a68f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::mcp_live::connection::server_loop (cognitive 17): op_host_services::mcp_live::connection::server_loop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (4 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":"crates/op-host-services/src/mcp_live/connection.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"496dd4fc415dcaf1cfa19963cf79403461bc22b8b5299800ad6c932c1e7e2a38"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::cursor_move_modal_tiers (cognitive 17): WidgetHost::cursor_move_modal_tiers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (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":"crates/op-host-web/src/widget_host/cursor_input_modals.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08a224c5c9eab758387c1c8c896064146879e8077bc839aa2b24f411c1252c5"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_canvas_node_press (cognitive 17): WidgetHost::apply_canvas_node_press has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/node_drag.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"563b0fbcc9e9ea0468cc3da66f3ce56b5bab5c111c4a529e1b965bc95a342e59"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_path_anchor_drag_move (cognitive 17): WidgetHost::apply_path_anchor_drag_move has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/pen_press.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"982bc3988ba696ac6c9e1a9c1ae726d2c1e81d08da8b89c8f0f4da263a6006d7"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_press (cognitive 17): WidgetHost::apply_press has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 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":"crates/op-host-web/src/widget_host/press.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb51c7015e747a3605f15bbbb537e2e2888f25674e4b61b42e5e5caaec0f4a61"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::preview_dispatch_move (cognitive 17): WidgetHost::preview_dispatch_move has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1949484a02ee13a484f2918b5e9990c32fd68c933d26995c004f3dc58d1fa684"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_topmost_overlay_tiers (cognitive 17): WidgetHost::press_topmost_overlay_tiers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d212fab3f55ba8f4c6fbb5b57133bb4b96e2656d5af3f2be1adf84b976fdf37"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::apply_pan_gesture (cognitive 17): WidgetHost::apply_pan_gesture has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/wheel_pan.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"179f26c573a2ab332c13f3dd87e85046daa5fc3703f46b72f119b52574cd6343"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_web::web_settings::apply_payload (cognitive 17): op_host_web::web_settings::apply_payload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_settings.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72def31252c1457a1291fdfda8270b324a896c9433150dbd79aa387d4b4b344"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_margin_collapse::choose_component_edge (cognitive 17): op_html::mapper_margin_collapse::choose_component_edge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_margin_collapse.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ad72e17067fdb11a1fd6a81789c955f739d74311bee5a485708fb0cae3004b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::snapshot_text::styled_content (cognitive 17): op_html::snapshot_text::styled_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/snapshot_text.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c660c9e6dcf9bc17209d6bf6270947574f7d8aea35bd3ab70057421d07ac02a2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::import_html_with_resources (cognitive 17): op_html::import_html_with_resources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1d1a6be1ef1c925bd2dd1e41307c74ad1fed7db5f6fb2ab17993d96e1baa77"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::declaration_syntax::extract_function (cognitive 17): op_html::css::declaration_syntax::extract_function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), 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":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ae3c5a48272e74307b62ac29f09421cf8c86047d50676eac61ef976116cbc9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::selectors_parser::split_selector_list (cognitive 17): op_html::css::selectors_parser::split_selector_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cccefb0e594d9df4e0a17ae8a118962935778fc5cf0e21e78c1c8a279b35161"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::selectors_parser::split_nth_of (cognitive 17): op_html::css::selectors_parser::split_nth_of has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, match/switch 1 (2 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":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ac2e92625717b6c0f076b6bd91491374e49993a7a4dd4ecb16b20d03e8511e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::transform::transform_origin (cognitive 17): op_html::transform::transform_origin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/transform.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"2218bb988f5dc2ce7d4304592217ded8324e4d853d1dde32cc51fd17cb9e4e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_visual_syntax::split_whitespace_top_level (cognitive 17): op_html::mapper_visual_syntax::split_whitespace_top_level has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_visual_syntax.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d2bdcf66e07a498b862e61420629b12b8ed92d2cabf786765fd184943c9524"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::script_runner_dotted_keys::dotted_key_at (cognitive 17): op_mcp::script_runner_dotted_keys::dotted_key_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner_dotted_keys.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc1a62551f7ebece2130ec168f6108b79774bb9fdc5f361999581290d5fe36"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_fill_normalize::normalize_fill_item (cognitive 17): op_mcp::batch_design_fill_normalize::normalize_fill_item has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_fill_normalize.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf49ec26c761fb03b957a8230bccfbd75c79c8ab154c18854a75b4c9f4fe339"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::parser::params_body_if_present (cognitive 17): op_mcp::parser::params_body_if_present has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6270746b63de359210033277c1611fa11e0c8b7ff48f7c1508ad5fc8569705f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_infer::infer_role_from_name (cognitive 17): op_orchestrator::role_infer::infer_role_from_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_infer.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02a27f55b75c6fe2a56603a5f2b9075b1681bdd00019881581cc12ebf634f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::geometry_interaction_backfill::collect_card_targets (cognitive 17): op_orchestrator::geometry_interaction_backfill::collect_card_targets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_interaction_backfill.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"242fbeb9ce421ea2072584aa6faba7608d355744bea0634248e978339b81b3ff"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::motion_recipes::collect_card_family_patches (cognitive 17): op_orchestrator::motion_recipes::collect_card_family_patches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/motion_recipes.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b5e1cf5adc8f11d589769c79c9a29fdb763b9c593c0c410556aaf0bca0cc63"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::orchestration_self_check::sibling_structure_drift_hit (cognitive 17): op_orchestrator::orchestration_self_check::sibling_structure_drift_hit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bb78fbce491b662af5e49c4f061e0b549e3c7a9717db420671320531f5b787"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_slide_padding::patch_copy_group (cognitive 17): op_orchestrator::cleanup_slide_padding::patch_copy_group has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e26b4844696452fc857fc3f85d11b1d572562fb71d39da7f6a0ce9e916db818"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::plan_normalize_items::bundle_repeated_item_families (cognitive 17): op_orchestrator::plan_normalize_items::bundle_repeated_item_families has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), match/switch 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":"crates/op-orchestrator/src/plan_normalize_items.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"840979a17fda5ef5c2b649b7d57ddb7e1e69eda735f800070f2deb4aa10d0a03"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::category_grid_density::repair_tile (cognitive 17): op_orchestrator::category_grid_density::repair_tile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47ec486fa7e61e130140b241b4e1ec2fc654ceade96da7e455dbbbb492d283d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_process_io::process_tree::terminate_tokio_process_tree (cognitive 17): op_process_io::process_tree::terminate_tokio_process_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-process-io/src/process_tree.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a841cc16fbd8d178555216159696b078fc8c6b922659aab4e99015d3103f42b"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::design_md_import::scan_hex_colors (cognitive 16): op_ai_skills::style_guide::design_md_import::scan_hex_colors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/design_md_import.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540dcca3d664a2d73bddbf0766730efcf7f951890909bb1e9d7e6bfc5281b14"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ai_skills::style_guide::token_table::extract_prose_radius (cognitive 16): op_ai_skills::style_guide::token_table::extract_prose_radius has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/token_table.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d03ff72aebacbaaa5d398bc38c6024085d307474bed2d41f188bf83e54b5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"op_auth_bridge::collab_claims::validate_claims (cognitive 16): op_auth_bridge::collab_claims::validate_claims has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c29141c7bc091d6a581601494c1295bf5c01f53e6edf47006af3faabe256f8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_codegen::ai::parse::infer_imports_from_code (cognitive 16): op_codegen::ai::parse::infer_imports_from_code has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/ai/parse.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7272e87cefd41a4e022cd903c69e9f2a531e979234d4058cee464419b152c84"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestSessionCore::handle_snapshot (cognitive 16): GuestSessionCore::handle_snapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest_sync.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed4ef9e89517ac4b058ce4bdca9023bf5b8302c0f5ff1f3a9f291cebe14f7da"}},{"ruleId":"D2","level":"warning","message":{"text":"GuestSessionCore::prepare_commit_install (cognitive 16): GuestSessionCore::prepare_commit_install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest_sync.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4c21c38a7c74efcc873aa261a32d42dfb005c5b172cee88b827e5d3b69f0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnerSessionCore::handle_submit (cognitive 16): OwnerSessionCore::handle_submit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/session_submit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd934b8cfd21a79f0a2a1ff269466586fc9abc32120b8e2af014736d17d205c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab::diff_fields::collect_property_changes (cognitive 16): op_collab::diff_fields::collect_property_changes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/diff_fields.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dda889572b62df59b06b0c0addf163aad856bb553d6773b10c10731ef3af944"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionDriver::poll_write_once (cognitive 16): ConnectionDriver::poll_write_once has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 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":"crates/op-collab-transport/src/driver.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cffa397f869169001e016a520b2d9b8a038029d424cf94139a20cdefd5a2c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_collab_transport::discovery_bonjour::publisher_worker (cognitive 16): op_collab_transport::discovery_bonjour::publisher_worker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), 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":"crates/op-collab-transport/src/discovery_bonjour.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"625b8dc57974faccb4dacdbc621788178e60cb8e0a4b50bbd5d3c500c5c3db29"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::detectors::motion_budget::collect (cognitive 16): op_design_lint::detectors::motion_budget::collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/motion_budget.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a85ae9e843b69d8c33f12a914fdad49d6e1b39806a6167a0fdec9a746fd309"}},{"ruleId":"D2","level":"warning","message":{"text":"op_design_lint::design_form::classify_root_form (cognitive 16): op_design_lint::design_form::classify_root_form has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/design_form.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22fcda0b3d2c7a6b69c9e8a42a9b8b61ac0cc1a9c21dc42acd24536f8ebea86"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorState::cmd_insert_node_with_allocator (cognitive 16): EditorState::cmd_insert_node_with_allocator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node/state_ops.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"20673dbfd10768c28561e5fdb30ce8504f5c1b9c49f3ebc3773d51eddc8fe8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::icon_path_normalize::normalize_icon_paths_in_nodes_with_report (cognitive 16): op_editor_core::icon_path_normalize::normalize_icon_paths_in_nodes_with_report has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cced5ae6ad8a71cee749864ce4c3a62417630f1ea049dfe76cc541f1c66ee032"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::document_install::validate_install_document (cognitive 16): op_editor_core::document_install::validate_install_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/document_install.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a23ddeec545f357b3b946c332aa0d84ee83eff437edbd9b9dc9578f0e10503f"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::host_keyboard_transitions::variable_row_accepts (cognitive 16): op_editor_core::host_keyboard_transitions::variable_row_accepts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, match/switch 1 (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":"crates/op-editor-core/src/host_keyboard_transitions.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1dda1c7ac2057ddad2156ee2aff6d89883aad53849d8b810a3935052cefe6c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_core::uikit_io::build_kit_document (cognitive 16): op_editor_core::uikit_io::build_kit_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (5 pts), 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":"crates/op-editor-core/src/uikit_io.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4baad4e4f9cf6af00bb60b7c806bd016ab8a17306f94ddbbb31a2dcc061c831"}},{"ruleId":"D2","level":"warning","message":{"text":"FileMenu::hit (cognitive 16): FileMenu::hit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/file_menu.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c855f1ebc1c68ae50649912cdc4c8104801585a93dcf962a72b016c08dc54d"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPanel::paint_empty_card (cognitive 16): GitPanel::paint_empty_card has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_empty.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc801f6d8a336a2be7343abf641f11cbbd4ad190b9f5f5c6fae755e3d27ae10"}},{"ruleId":"D2","level":"warning","message":{"text":"SceneTemplatePanel::hover_at (cognitive 16): SceneTemplatePanel::hover_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_hit.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"be36ebabb394dcc34af0cbcc1a8e53eb4dd882227805cf299cc372e1ad5d862c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_text_edit::text_edit_layout (cognitive 16): op_editor_ui::widgets::canvas_text_edit::text_edit_layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_text_edit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0db2f4d9eeef894edcc23e53323244f64e8cd6230dc2ae3bb600dbb743a4c7"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::drag_flow::deepest_container_at (cognitive 16): op_editor_ui::widgets::drag_flow::deepest_container_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/op-editor-ui/src/widgets/drag_flow.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa09a3c4e22251664bb951daee660f3619c81042d75c21c8fff92a59466b8f0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::canvas_viewport_overlay::paint_node_fill (cognitive 16): op_editor_ui::widgets::canvas_viewport_overlay::paint_node_fill has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f057705379252991144aff4751c6de2d30595cfd08cf9bfbe0eb89ad38de8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_design::place_design_blocks (cognitive 16): op_editor_ui::widgets::ai_chat_transcript_design::place_design_blocks 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":"crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee476b77f2803109a8d6b43f2f2f7bd15c0f7fbf37eea9a87da69d11bdec6a85"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::agent_settings_acp::paint_connection_button (cognitive 16): op_editor_ui::widgets::agent_settings_acp::paint_connection_button has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccd309d9cc032a890bf86522b40b3a828ec1a15dbf77996a541f6c4a3f7e7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::svg_export::emit_path (cognitive 16): op_editor_ui::svg_export::emit_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/svg_export.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa22650a077e41259518dc3d20b15d8ffeaba37f039d8f62c5da7da13639340a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_panel_paint::paint_examples (cognitive 16): op_editor_ui::widgets::ai_chat_panel_paint::paint_examples has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1 (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":"crates/op-editor-ui/src/widgets/ai_chat_panel_paint.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d616b2e8f64768d752f9a984f857252ae6c563fbd72d51621e01220a03d46dd"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::ai_chat_transcript_steps::split_design_progress (cognitive 16): op_editor_ui::widgets::ai_chat_transcript_steps::split_design_progress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"crates/op-editor-ui/src/widgets/ai_chat_transcript_steps.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c95a2b728536cbcff1e4315723ec53900f748fb43e6e98e6502d09b3a71244d"}},{"ruleId":"D2","level":"warning","message":{"text":"op_editor_ui::widgets::icon_catalog::search_icons_uncached (cognitive 16): op_editor_ui::widgets::icon_catalog::search_icons_uncached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/icon_catalog.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f10c3d7726dadb3b17967e778004ef040345f72c35661ecd850fdf50049b9e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::new (cognitive 16): Session::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/lifecycle.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e955f905b3fe66de13b442d812e60a7c1140fd6a2750e72ba779b92ed172680"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::vector_decoder::emit_oriented_chain (cognitive 16): op_figma::vector_decoder::emit_oriented_chain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e40bb1648f296b9f629be955837a768e3957f3387724e6b1caf21337156cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::text_mapper::parse_font_weight (cognitive 16): op_figma::text_mapper::parse_font_weight has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/text_mapper.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a491f5dba04e2e1542db8f92c53cd77234f5c402670422bdf5a955b15f4fcd20"}},{"ruleId":"D2","level":"warning","message":{"text":"op_figma::image_resolver::patch_fills (cognitive 16): op_figma::image_resolver::patch_fills has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/image_resolver.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c1f766e2eb01387ada2dc72fcd7beeaddcb82f1a7c8619d9d0808e193904c0"}},{"ruleId":"D2","level":"warning","message":{"text":"op_git::remote::build_callbacks (cognitive 16): op_git::remote::build_callbacks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-git/src/remote.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ed1979bad224720481675125568fff353ec994fa752ff8c1191e3d3070c726"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageDecodeHost::pump (cognitive 16): ImageDecodeHost::pump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (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":"crates/op-host-desktop/src/image_decode_host.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdeeddf73efd6bbd5d9aabda05200a74424b2dde85056793cf8d8ee170be188"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_desktop::init_auth_runtime (cognitive 16): op_host_desktop::init_auth_runtime has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/main.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93e6f56e47b58e4e2843326aa5ef6e93dce896d5fcccefba67e982e436b23fa"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeBackend::cached_raster_svg_path (cognitive 16): NativeBackend::cached_raster_svg_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 1 (2 pts), 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":"crates/op-host-native/src/backend/skia/path.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"706d4359e9d35e9ce45eb0e64349e9c4d1da31dd03d7d135f57d69fc566829af"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHostNative::ai_chat_rect (cognitive 16): WidgetHostNative::ai_chat_rect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ai_chat_geometry.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d4e77ffe38306c28b7bfad63b97e88d751d1105bde5662c66a798e884a12d1"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::design_md_evidence::validate_component_sample (cognitive 16): op_host_services::design_md_evidence::validate_component_sample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"6490a5f9efe066c0ab71afdb5618574ca19f2aabac2110641a1d84f5869b8f63"}},{"ruleId":"D2","level":"warning","message":{"text":"op_host_services::web_canvas_server::online_run_loop::run_online_web_canvas (cognitive 16): op_host_services::web_canvas_server::online_run_loop::run_online_web_canvas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 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":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2825633157711db7177ed8bd55143c140998a9026971dc56183b4cc3fc45fef3"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetHost::press_variable_value_cell (cognitive 16): WidgetHost::press_variable_value_cell has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 3 (6 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/variables_panel_rows.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b80e4a1dc20dcd469a6222404ea8a0dbade2adf8f5115d82a18d6be96f9627"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::cascade_conditions::media_query (cognitive 16): op_html::css::cascade_conditions::media_query has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (3 pts), match/switch 1 (3 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":"crates/op-html/src/css/cascade_conditions.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d508267d37fc1746da1bf79646d8d713cb2be8626c94f3745a582517f152b568"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_wrap::apply_flex_wrap (cognitive 16): op_html::mapper_wrap::apply_flex_wrap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_wrap.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e629db50dc04b97f5ebef06df203b16ed30e0f182282667bde7c14dc4805fb62"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_grid::scan_top_level (cognitive 16): op_html::mapper_grid::scan_top_level has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 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":"crates/op-html/src/mapper_grid.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9364e1bd53b3b3cf87322d4a22cb75281de348e52c0621e5e05805106a7f232c"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::project_zip::inspect_archive (cognitive 16): op_html::project_zip::inspect_archive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d54202c7c838782c4f5928b934d34b2c23235267b83277ff60c84ef69e83a9"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::css::declarations::expand_font (cognitive 16): op_html::css::declarations::expand_font has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 2 (3 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":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bee1227c5629066eb7d24083d2808a674b0b6956a69a604fe6ef2c3ded0f23"}},{"ruleId":"D2","level":"warning","message":{"text":"op_html::mapper_visual_syntax::matching_paren (cognitive 16): op_html::mapper_visual_syntax::matching_paren has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), 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":"crates/op-html/src/mapper_visual_syntax.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f3b620ea955738b26a68fa9df91151159f75aafff5f95590f7cff6c574eb86"}},{"ruleId":"D2","level":"warning","message":{"text":"op_image_enrich::net::judge::select_with_judge (cognitive 16): op_image_enrich::net::judge::select_with_judge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/judge.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"404f2a95649f74bbdf7191310bfc75d0a0f0e6d208dd655de701c87d8a06fc48"}},{"ruleId":"D2","level":"warning","message":{"text":"op_image_enrich::apply::apply_result (cognitive 16): op_image_enrich::apply::apply_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (5 pts), boolean chains 3 (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":"crates/op-image-enrich/src/apply.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"937197439f3d4f8e63701f786c1a6e8a32adb3a060f6efdc5eb17ecf01a3dd61"}},{"ruleId":"D2","level":"warning","message":{"text":"op_image_enrich::net::providers::relevance::retain_relevant_hits_enforcing (cognitive 16): op_image_enrich::net::providers::relevance::retain_relevant_hits_enforcing has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 6. 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":"crates/op-image-enrich/src/net/providers/relevance.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bb7b90586402e582d45b1e30e937d50510f5941813a44c5acf67628d45307a"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::tool_search::keyword_search (cognitive 16): op_mcp::tool_search::keyword_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/tool_search.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aca1ac90efff7fe752a701f1dbb9e542d9c1bd3edc5143d6e5d160776ddcb6"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::batch_design_dsl::split_operations (cognitive 16): op_mcp::batch_design_dsl::split_operations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"crates/op-mcp/src/batch_design_dsl.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0a7447721dcd602fc1962c60aad3a8a66576129fc71f334c9da29c08b6652"}},{"ruleId":"D2","level":"warning","message":{"text":"op_mcp::style_ops_tools::parse_replacements (cognitive 16): op_mcp::style_ops_tools::parse_replacements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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":"crates/op-mcp/src/style_ops_tools.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ee592811c3446b32ce963eda1a61d71402510f83eb262dbe7781a9b9242bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::run_screen_groups::insert_screen_group_roots (cognitive 16): op_orchestrator::run_screen_groups::insert_screen_group_roots has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_screen_groups.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9557a302ca3d8f02dcd25d253ffe1bc079f60a08c9b9fdc10e17fd14449828"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::app_shell_evict::ensure_row_mut (cognitive 16): op_orchestrator::app_shell_evict::ensure_row_mut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/app_shell_evict.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3d8c40717cb4b2a62c4169f377a4fc28d9852c74c5397cbb9932cbb788d4db"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::app_shell_evict::try_evict_in_shell (cognitive 16): op_orchestrator::app_shell_evict::try_evict_in_shell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 1 (2 pts) (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":"crates/op-orchestrator/src/app_shell_evict.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e10e9bb6e4fd6235d51a7fa68abc4438c83ca4742edb90dbe0f3a6cb4bf0fb"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::board_trailing_void::content_bottom_under (cognitive 16): op_orchestrator::board_trailing_void::content_bottom_under has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/board_trailing_void.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9acee196a5e90f46b2922680e972ce334d8942e68bdbd6db886a0674f32afe"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::style_guide_context::build_planning_style_guide_context (cognitive 16): op_orchestrator::style_guide_context::build_planning_style_guide_context has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (3 pts), loops 1 (2 pts) (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":"crates/op-orchestrator/src/style_guide_context.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee7acf237c1aa06a59743be4b2dc436d332519f78ed2aa03e64c5ce23f8d12e"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::retry_subtask::retry_subtask (cognitive 16): op_orchestrator::retry_subtask::retry_subtask has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/retry_subtask.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e89dce0205bc00267604006bbf5e31ff7cb109d0b20fbb856dd3806a0565496"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::validation_fixes_apply::auto_fix_parent_layout_after_add_child (cognitive 16): op_orchestrator::validation_fixes_apply::auto_fix_parent_layout_after_add_child has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2281ae4c5d56a424b812791af49c5d1ddd0ec942c01de23add72efb3f5a75cda"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::loop_finalize_record::snapshot_direct_nodes::walk (cognitive 16): op_orchestrator::loop_finalize_record::snapshot_direct_nodes::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize_record.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c751f8996377c94e553435f6fc737bd0b338595d9b572857626ed81f60338569"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::concurrent_replay::run_screen_group_worker (cognitive 16): op_orchestrator::concurrent_replay::run_screen_group_worker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent_replay.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8ab64d271231a526a7e412e122d75e314eec5ef7fc159f4cdfadc20a040c25"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::role_defaults::role_defaults (cognitive 16): op_orchestrator::role_defaults::role_defaults has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_defaults.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff39f5adaafef4ef381c231f3a74928eed2f46955614aec0584e4dae8ab0e41"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::tree_heuristics_nav_rounding::round_nav_tab_items (cognitive 16): op_orchestrator::tree_heuristics_nav_rounding::round_nav_tab_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, 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":"crates/op-orchestrator/src/tree_heuristics_nav_rounding.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d5947e98fb829e6bd2fad0f549a3893b01ecb2f0fcbcf1f35e1f6f4f0a9c27"}},{"ruleId":"D2","level":"warning","message":{"text":"op_orchestrator::cleanup_desktop_dashboard::collect_sparse_row_repairs (cognitive 16): op_orchestrator::cleanup_desktop_dashboard::collect_sparse_row_repairs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_desktop_dashboard.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8e37890825a786cf3f021f139c89c90cbbf895c3d00e2469303620660bbd25"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingOverlay::consume_scroll_requests (cognitive 16): BindingOverlay::consume_scroll_requests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 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":"crates/op-preview-core/src/binding_overlay.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c518fd49b3e2c0544a0c21531ed710ff17cf8c4720a1a5ba5005cfc19cf43e"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewSession::enter_with_host_motion_preference (cognitive 16): PreviewSession::enter_with_host_motion_preference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/session.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebf2c05686d6bc67b039e3e2844c95d3df6c7a1ed3c639589e3c37006fa4f93"}},{"ruleId":"D2","level":"warning","message":{"text":"op_smoke::loop_mode::run_loop (cognitive 16): op_smoke::loop_mode::run_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 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":"crates/op-smoke/src/loop_mode.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e916f0784c7ab448bea124ceb3123f842359c0e589b8a4906506d5d7fefee9c"}},{"ruleId":"D2","level":"warning","message":{"text":"OpSurfaceView.surfaceCreated (cognitive 16): OpSurfaceView.surfaceCreated has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceView.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b5639330ab91a2bbca43897123d661dca1102a2808a680b4133259c379ef73"}},{"ruleId":"D2","level":"warning","message":{"text":"check-collab-bootstrap-urls.canonical_host (cognitive 16): check-collab-bootstrap-urls.canonical_host has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/check-collab-bootstrap-urls.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ca83f093a444ef2429b20cb77677a6d2fb5e9b64a60f15abe3bbd5ef628790"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ck_bridge.opCkParseFontFamilyStack (cognitive 16): op_ck_bridge.opCkParseFontFamilyStack has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b0fb60a98fdc085fd7823602fcd470b221842bc23b70c42a8034af1503e1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ck_bridge.opCkMakeRuntimeShader (cognitive 16): op_ck_bridge.opCkMakeRuntimeShader has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 3, if/else 2 (3 pts), loops 2 (3 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4738a7908e48f686842e8d7831e6c46e53d7577831c1b6bbac265e92fcd58c98"}},{"ruleId":"D2","level":"warning","message":{"text":"codegen-prompt.parseCodegenOutput (cognitive 16): codegen-prompt.parseCodegenOutput has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 4, error handling 1, ternaries 1. Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 53). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/src/vscode/codegen-prompt.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"98df392a5ca7f7870653da18ee2120d3c85164146cde604b98c53050f112d44c"}},{"ruleId":"D2","level":"warning","message":{"text":"collectDesignEvidenceInPage::componentSample (cognitive 16): collectDesignEvidenceInPage::componentSample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, other 1, ternaries 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":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee68c9df0f4ebe6b5b818aabbab9b72dff797a9b095073fc28c07ede31a2d87"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WidgetHostNative: TooManyMethods \u2014 652 methods, declared across 108 files: widget_host/geometry.rs (29), widget_host/shortcuts.rs (28), widget_host/overlay_rects.rs (25), widget_host/input.rs (22), \u002B104 more file(s). The bar is 30 methods; this is 622 over it, 21.73\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":"crates/op-host-native/src/widget_host.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"242e7ca8d34d626c3b596900543dad96f3ad420d0c7b44eb269dbfe9f9ced5aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WidgetHost: TooManyMethods \u2014 427 methods, declared across 80 files: widget_host/preview_frame.rs (30), widget_host/keyboard_edit_ops.rs (24), widget_host/host_lifecycle.rs (21), widget_host/image_panel_dispatch.rs (20), \u002B76 more file(s). The bar is 30 methods; this is 397 over it, 14.23\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":"crates/op-host-web/src/widget_host.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cbda0f708759a043371b51a57ec525a2d9ee6a7f33aa5ddd7510a131d0eeca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorState: TooManyMethods \u2014 362 methods, declared across 53 files: src/mutators.rs (37), command_node_attrs/state_ops.rs (25), src/property_edit_mutators.rs (25), src/text_edit.rs (23), \u002B49 more file(s). The bar is 30 methods; this is 332 over it, 12.07\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":"crates/op-editor-core/src/state.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2b4efff78863b32eb390dddb7ece6626c0871189fe3449a4648cdbd954b6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_ck_bridge.opCkInit: FunctionTooLong \u2014 opCkInit runs 1167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1067 over it, 11.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a07af838c21ace690c8958ae5c060facfb6df25b5e9d5ab8eec4bd29a1af370"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_web.__wbg_get_imports: FunctionTooLong \u2014 __wbg_get_imports runs 982 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 882 over it, 9.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":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae3c966b8eb4a73c59a187898b031f637007ba2670bf2fda63b4f8f4477aff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EditorUiState: TooManyFields \u2014 220 stored fields beside 97 methods. The bar is 30 stored fields; this is 190 over it, 7.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/editor_ui_state.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe10297341f16c1077923cf0d2812b400e98832e388f5b02047f2f5e4dee7e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_web.__wbg_get_imports: FunctionTooLong \u2014 __wbg_get_imports runs 684 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 584 over it, 6.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":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a4dbdcfb7a465845bd0da2e2a06e417871041b773f6dccd9fd232e7dd96927"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorState.apply_with_allocator: MethodTooLong \u2014 apply_with_allocator runs 578 significant 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 478 over it, 5.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_apply.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c687af15bd4301c755f2ec9ce16493d2cf0fb89d2ae2c0f515050a8527debfd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DesktopApp: TooManyMethods \u2014 158 methods, declared across 29 files: git_host/repo_ops.rs (15), src/app_state.rs (14), src/keyboard_input.rs (11), app_handler/pointer_events.rs (10), \u002B25 more file(s). The bar is 30 methods; this is 128 over it, 5.27\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":"crates/op-host-desktop/src/main.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8dcb31204c1c094e67eb9f5a8e5f6440da513b876727ea939dc050e5e74344"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.apply_cursor_move: MethodTooLong \u2014 apply_cursor_move runs 518 significant 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 418 over it, 5.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":"crates/op-host-web/src/widget_host/cursor_input.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c123d18d1dcb37eb7963f8df69ef13e995b170dcd859052501162c0abff83d14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_dispatch::apply_property_action: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_dispatch::apply_property_action runs 475 significant 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 375 over it, 4.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":"crates/op-editor-ui/src/widgets/property_panel_dispatch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12d8d4aafc7d13dea1045d6e8ee480e6aa5c7475562440e598089f9c45b54cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GitPanel: TooManyMethods \u2014 134 methods, declared across 19 files: widgets/git_panel_ready.rs (18), widgets/git_panel_diff.rs (13), widgets/git_panel_tracked_picker.rs (12), widgets/git_panel_commit_card.rs (10), \u002B15 more file(s). The bar is 30 methods; this is 104 over it, 4.47\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":"crates/op-editor-ui/src/widgets/git_panel.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c0840012ab39220aabcfc405a4b56b8f21ae9025d39590a159dca298519329"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_figma::instance::apply_instance_overrides_cached: FunctionTooLong \u2014 op_figma::instance::apply_instance_overrides_cached runs 435 significant 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 335 over it, 4.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0537ef428c7a7e2baa6912cb6511a5b14b15f85d4e847b2f3d27c00a25b64a7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SceneTemplatePanel: TooManyMethods \u2014 128 methods, declared across 11 files: widgets/scene_template_panel.rs (34), widgets/scene_template_card_paint.rs (20), widgets/scene_template_touch_density.rs (20), widgets/scene_template_panel_paint.rs (12), \u002B7 more file(s). The bar is 30 methods; this is 98 over it, 4.27\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":"crates/op-editor-ui/src/widgets/scene_template_panel.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f519c3749f4718f6db8fb24ab4f72a1cc60deda0ca4520cf31e5aa5862ed8d18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CollabPanel.paint: MethodTooLong \u2014 paint runs 422 significant 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 322 over it, 4.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":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0454e2d6cff00d6f13055e9a4ee430d555df12c5708fd2083b7a7a38834e8032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.paint: MethodTooLong \u2014 paint runs 415 significant 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 315 over it, 4.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867040eb148cc41ba93e05a48b69678d1e714a2fbfcf7a56379c69e89eaf924"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Orchestrator.run: MethodTooLong \u2014 run runs 411 significant 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 311 over it, 4.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":"crates/op-orchestrator/src/run_orchestrator.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6fc7b2446bc2ff94186eb8c62868387a2b82d1a4a4713f3c89af1d08bb1f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropertyPanel.paint: MethodTooLong \u2014 paint runs 398 significant 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 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/paint.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb4df72c4d0d126f0bb6816197d907f9ce1194150b7445970f24798b9b79114"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreviewSession: TooManyMethods \u2014 113 methods, declared across 11 files: src/input.rs (24), src/session.rs (17), src/session_paint.rs (15), src/present.rs (13), \u002B7 more file(s). The bar is 30 methods; this is 83 over it, 3.77\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":"crates/op-preview-core/src/session.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"667ab6cdc811e23e96c290809867720142d69d138061468a7d93cae198e41fb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner: FunctionTooLong \u2014 op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner 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":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6c0c67821ecab86fc24f4f0b852e29cd6f81a282f9c028f03eadb5748c51bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit runs 369 significant 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 269 over it, 3.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":"crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d6957ffb6c2ca730411e139c6225f890fcb3537aa4314b884f12627246dbc9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.update_agent_settings_hover: MethodTooLong \u2014 update_agent_settings_hover runs 365 significant 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 265 over it, 3.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/geometry_settings_hover.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553eefeb78566abe6e25c7104efd755092c8bdccee800f957be1a2b5ae6ddc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_web::canvaskit::mount::mount_ck: FunctionTooLong \u2014 op_host_web::canvaskit::mount::mount_ck runs 345 significant 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 245 over it, 3.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/mount.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce042b235e79a4cdbf410c93106e45da0edcda1185cbe28c088a491cee25743"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_ck_bridge.opCkInit: FunctionTooLong \u2014 opCkInit runs 344 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 244 over it, 3.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"962fd0a6c01e882c8e490d8ac6521ebc711ab74131b399e310d7932fcb977c75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CollabRuntime: TooManyMethods \u2014 101 methods, declared across 13 files: src/runtime.rs (28), runtime/effects.rs (20), runtime/effects_wire.rs (11), network/lifecycle.rs (9), \u002B9 more file(s). The bar is 30 methods; this is 71 over it, 3.37\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":"crates/op-collab-host/src/runtime.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d0c47083848eaf8e125157a6d8a62a242d731377e62338190aaefb9a39076"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_layout::layout_for_scrolled: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_layout::layout_for_scrolled runs 333 significant 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 233 over it, 3.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":"crates/op-editor-ui/src/widgets/home_surface_layout.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d320ae65143dba6d8ec83ab89de5416edf0b2b92170ac3140b7e219a9cf7bff4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TopBar.paint_chrome: MethodTooLong \u2014 paint_chrome runs 325 significant 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 225 over it, 3.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_paint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f413111f12bdfce502ae673def2cf5bfcf340cfc176c4e1fc666ef8b21e64d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorUiState: TooManyMethods \u2014 97 methods, declared across 8 files: editor_ui_state/methods.rs (59), src/host_escape_transitions.rs (19), src/host_keyboard_transitions.rs (5), src/host_ui_transitions.rs (5), \u002B4 more file(s). The bar is 30 methods; this is 67 over it, 3.23\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":"crates/op-editor-core/src/editor_ui_state.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf4e427d289e6d374f6cbad5709aa638f0ab3ff465aba897c525e5535b3f29d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.dispatch_git_panel_press: MethodTooLong \u2014 dispatch_git_panel_press runs 312 significant 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 212 over it, 3.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":"crates/op-host-native/src/widget_host/git_press.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a1d94fe7cf0010a487c0ec0b1391d3a747bed59e00eb0e236186f8897078d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.paint_editor: MethodTooLong \u2014 paint_editor 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":"crates/op-host-web/src/widget_host/paint.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"46745fdd969c7207e0b7a1713242041a487f0411918c8647cba5eea75a5e985f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes: FunctionTooLong \u2014 op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes runs 307 significant 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 207 over it, 3.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/prompt_subagent.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33d43c7845ee820948ad0c0f3a19f54d388d329d37b55d1367a3edab26b18a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.on_redraw_requested: MethodTooLong \u2014 on_redraw_requested runs 305 significant 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 205 over it, 3.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":"crates/op-host-desktop/src/app_handler/redraw.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2432383f3bc42f3b6b901186f57268a8a425ef0649e6e1e5e6daa5f30fc4fac4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeBackend: TooManyMethods \u2014 91 methods, declared across 7 files: backend/skia.rs (35), skia/path.rs (23), skia/text.rs (10), skia/image.rs (9), \u002B3 more file(s). The bar is 30 methods; this is 61 over it, 3.03\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":"crates/op-host-native/src/backend/skia.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b00986571be64b9bd79563e507d2a020a7c9d486f91fdb948267403edbe33d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.update_agent_settings_hover: MethodTooLong \u2014 update_agent_settings_hover runs 299 significant 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 199 over it, 2.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":"crates/op-host-web/src/widget_host/agent_settings_hover.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0d9d4beb34a529f8b18837c41c364eed533f1268b26e30300c1e177f6935a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayerPanel.paint: MethodTooLong \u2014 paint runs 298 significant 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 198 over it, 2.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7263aba52671eb7b1bb803513d6ca8b1a2cbeeae944bb6b96d6475cfa5e16aeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_canvas_server::connection::dispatch: FunctionTooLong \u2014 op_host_services::web_canvas_server::connection::dispatch runs 294 significant 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 194 over it, 2.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"972c1c6d3ab55f2da05459aaae49c2ade3bec4e6b14cc730eed467fd026a482d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PropertyPanel: TooManyMethods \u2014 87 methods, declared across 8 files: widgets/property_panel_overlay_hit.rs (33), property_panel/hit.rs (16), property_panel/menus.rs (12), widgets/property_panel_compositing.rs (9), \u002B4 more file(s). The bar is 30 methods; this is 57 over it, 2.90\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":"crates/op-editor-ui/src/widgets/property_panel.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aa63c7c738b9dbfc83ccb7cd49f087eb008c9d068e76b10fefa63c89bfca74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_smoke::main: FunctionTooLong \u2014 op_smoke::main runs 289 significant 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 189 over it, 2.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/main.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe831456b46021cbb7ea0d58e8462682901f88e7e62f0e7bd20a7bbdacb4042"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasViewport.paint: MethodTooLong \u2014 paint runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d8f1cc57de5318b89a0ff1bda51d143c8b0db11847b5ac51e3213e63cfde4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/op_ck_bridge.js: FileTooLong \u2014 1367 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 85% of them inside a single declaration: opCkInit (308-1931). The bar is 500 significant lines; this is 867 over it, 2.73\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f3b2498336c22a34e327398a94e33c4d962fa836e270285d84702ea53c5f4b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DesktopApp: TooManyFields \u2014 82 stored fields beside 158 methods. The bar is 30 stored fields; this is 52 over it, 2.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/main.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"859b70f3071a8387dbf8c5a3e20857867530be27a4ca1bfa2b12cf2229ce0f91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker runs 273 significant 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 173 over it, 2.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_layout.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42644c641c3ba33a9d688d29fecb55906b64edd2d203b1960d437d11eebdf20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::ai_chat_transcript::build_item: FunctionTooLong \u2014 op_editor_ui::widgets::ai_chat_transcript::build_item runs 267 significant 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 167 over it, 2.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3159a166511400b60aaec54bc2311b85bc4e340a6685b31fdd1d9a78217eee8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_panels::paint_composer: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_panels::paint_composer runs 266 significant 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 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c53606582d7ac063a79347a47090bab432c0f0b9eeaf92ad8a6c579b29195b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: WidgetHostNative: TooManyFields \u2014 79 stored fields beside 652 methods. The bar is 30 stored fields; this is 49 over it, 2.63\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2f41b4a260e0b427ac8545a499c2829a21f965afe2dd40aaed2b8f620c41a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.paint: MethodTooLong \u2014 paint runs 256 significant 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 156 over it, 2.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":"crates/op-editor-ui/src/widgets/git_panel/paint.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6263f93bedf6636d8e8b1856d51b9f059ee949514b1cf777612179c8cdc35be4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorState.commit_property_edit_inner: MethodTooLong \u2014 commit_property_edit_inner runs 253 significant 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 153 over it, 2.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":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8442222043836c1c0ea0624727a855917c230e9f754d339b6c4fa1adba5e9e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pkg-webgl/op_host_web.js: FileTooLong \u2014 1248 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: __wbg_get_imports (66-1338). The bar is 500 significant lines; this is 748 over it, 2.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-webgl/op_host_web.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d351957589f53f80965693f6a2f883c74cfd8a1599afd8e9db2e6b70dd72664b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_fill_body::paint_fill_gradient_body: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_fill_body::paint_fill_gradient_body runs 248 significant 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 148 over it, 2.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":"crates/op-editor-ui/src/widgets/property_panel_fill_body.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e4d21e30c57bdfc904d049ba785fcf66b2bfc855d0f13d5c3d9546c4216d7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_escape: MethodTooLong \u2014 apply_escape runs 248 significant 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 148 over it, 2.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":"crates/op-host-native/src/widget_host/keyboard_escape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce681c4bff544ecaa51384397c375c51dcf05f5a8548a21014b33f63e407b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.handle_key_pressed: MethodTooLong \u2014 handle_key_pressed runs 245 significant 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 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/keyboard_input.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"abac2d9995a0009b54bd3ba6f626933ebfbc697f4ccb836f00a9d9ee70d9b221"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PropertyPanel: TooManyFields \u2014 73 stored fields beside 87 methods. The bar is 30 stored fields; this is 43 over it, 2.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb340a5630f616ea0d688ec883251a7317245082bc4f6e9adf6f1846ae444c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::chat_http_server::run_opencode_turn: FunctionTooLong \u2014 op_host_services::chat_http_server::run_opencode_turn runs 240 significant 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 140 over it, 2.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":"crates/op-host-services/src/chat_http_server.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3acbd5a900319414a9e5b2f1373679f0491099bd9f21713b63de843724cdb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::validation_fixes_apply::apply_validation_fixes: FunctionTooLong \u2014 op_orchestrator::validation_fixes_apply::apply_validation_fixes runs 236 significant 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 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed007c8e2901bdefb27ba98e7b7efa1f52b3fa54fbbc854af071dc8402f640fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpNative: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpNative.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ee7cac09528472472fb8ccaf373f44cff57ac483d559abe3ef38bb0141e09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_input_layout::editable_input_rects: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_input_layout::editable_input_rects runs 233 significant 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 133 over it, 2.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":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"436a213b143bdb1035d35e3fbf203b73f4891de4663f62de939bd757a50ef317"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AIChatPlaceholder.paint: MethodTooLong \u2014 paint runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d779e0baea56b574d0a7699af68293f8d8d13b73c1296a5f768094f87c78781e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_fill::paint_one_fill: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_fill::paint_one_fill runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6fd8b352e5dc77f2b50a76d4e75c850ef12ffa8879425bc095a44303573b8c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentSettings: TooManyMethods \u2014 69 methods, declared across 4 files: agent_settings/mutators.rs (28), src/agent_settings_builtin_models.rs (17), src/agent_settings_acp_connection.rs (12), src/agent_settings_connection.rs (12). The bar is 30 methods; this is 39 over it, 2.30\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":"crates/op-editor-core/src/agent_settings.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"584c69f48266f35332fa591f9e527462775269bfd1b5436ef98f785ce5c22ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_mcp::batch_layered_guidelines::generate_section_guidelines: FunctionTooLong \u2014 op_mcp::batch_layered_guidelines::generate_section_guidelines runs 229 significant 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_layered_guidelines.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50bcbc805d01a081d998d216693132dd0041cb238baf85c966a534557f60b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorUiState.default: MethodTooLong \u2014 default runs 222 significant 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 122 over it, 2.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":"crates/op-editor-core/src/editor_ui_state/defaults.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c026160fa35147c4538086ce125d2d943bccb7e66104f0923a71e5d282068c9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_ck_image_cache.createWebImageCaches: FunctionTooLong \u2014 createWebImageCaches runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5637bfd07fc70cf1e11d6ebe5d6f260fa739bcb103dbe1dac217bd436723da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 65 methods, declared across 11 files: src/lifecycle.rs (27), src/editor_collab.rs (15), src/pointer_gate.rs (8), src/editor_collab_presence.rs (4), \u002B7 more file(s). The bar is 30 methods; this is 35 over it, 2.17\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":"crates/op-engine-ffi/src/lifecycle.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb454979a8c000bc6b3144f2cb3336520ac0f2cc3b2fd2388b8e864ea6ed8efa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_art::paint_counter_window: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_art::paint_counter_window runs 213 significant 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 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_art.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a35cb91409caaa5c26adcd1e15d11a62dcdb54327b579d710694794e45518f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_relay_server::connection::serve_connection: FunctionTooLong \u2014 op_collab_relay_server::connection::serve_connection runs 212 significant 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 112 over it, 2.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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"839aa91e7152234a1d79f209b2aa5e57410e59cd2ad6b9264507ad40c21010b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::import_html_with_resources: FunctionTooLong \u2014 op_html::import_html_with_resources runs 212 significant 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 112 over it, 2.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":"crates/op-html/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"40faba6622b383f39bc191e9bde63ee38059fef211a7402f2b6eb61b1b2d85d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner: FunctionTooLong \u2014 op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner runs 211 significant 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 111 over it, 2.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":"crates/op-chat-agent/src/chat_agent_loop/openai.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"25db09fec29bf5b00be0491f7cc104d6099ff4164f14830a589953e4ae9e1e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.drain_git_action: MethodTooLong \u2014 drain_git_action 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":"crates/op-host-desktop/src/git_host.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc441576410c9505c3d048af17bcbc60b5e770138cc6b634a7824d6608c2279"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodePayload: TooManyFields \u2014 62 stored fields. The bar is 30 stored fields; this is 32 over it, 2.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/payload.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbc76f85867c880b11addbb68cfb7cb4caf26db77cfde9ff5f1833c797dfdba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OwnerSessionCore.handle_undo_request: MethodTooLong \u2014 handle_undo_request runs 205 significant 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 105 over it, 2.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":"crates/op-collab/src/session_undo.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5db5f39411698508f483a55c8f5a00d1ec631064e141b4c00d809ffd6a8a18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AIChatPlaceholder.hit_test_with_canonical: MethodTooLong \u2014 hit_test_with_canonical 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":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6630b8323c10f94988ca47e9f312632bd5ce940e8e7753213e7bd19bca0122"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes: FunctionTooLong \u2014 op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes 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":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11616db0545995b2114e08b4c86cc41e986351dfd4377e341729b3467ca392"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: WidgetHost: TooManyFields \u2014 61 stored fields beside 427 methods. The bar is 30 stored fields; this is 31 over it, 2.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":"crates/op-host-web/src/widget_host.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4cac3f3edf2822d920d9a8511f646ff4867ed16c56eed8747a6335de8bf767"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AgentSettings: TooManyFields \u2014 61 stored fields beside 69 methods. The bar is 30 stored fields; this is 31 over it, 2.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":"crates/op-editor-core/src/agent_settings.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"435c842c43cc71238b070cb2d44a084dce466bc7195df5495039372d4014c8a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar: FunctionTooLong \u2014 op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar runs 203 significant 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 103 over it, 2.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":"crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"11651da4d120244745d1813b9ef3dd033d0986e98ae170298e73adb6b681833a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes: FunctionTooLong \u2014 op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes 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":"crates/op-orchestrator/src/subagent.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0b9ee5194c5e8b8c6013cda9ec620b0418cca87e6c863eb2a1d12e7f188b69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner: FunctionTooLong \u2014 op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner 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":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5462488503c8a236ca03bf28aabe764e60b1909afaf7ab65a7a15ade5fd659f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.cursor_move_late_drag_tiers: MethodTooLong \u2014 cursor_move_late_drag_tiers runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_drags.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"81364af62f06e51484d709abf151da3c399c3d8045d16d367f073c78dcec13ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpSurfaceView: 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceView.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"17493751e27228ccbfe287be71109cc963552ec73a61601607b81d8ba1e3d22a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpEngineHost: 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":"packaging/ios/Sources/OpEngineHost.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"de26ef69787e55ff52d89eeb26b204050ff67ffae793d5e864bff74839e515ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_chrome_extension_core::wasm_api: TooManyFunctions \u2014 59 free functions. The bar is 30 free functions; 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":"crates/op-chrome-extension-core/src/wasm_api.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a122e4f5c945e08f9d7eb9e462c6f4e3739a3729df874ce527bb2e9448e91a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::style_guide_context::infer_tags_from_prompt: FunctionTooLong \u2014 op_orchestrator::style_guide_context::infer_tags_from_prompt runs 194 significant 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 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/style_guide_context.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e2358330903fc3cbc9829d998a717561ce9f132bf881f8124d02c5a34c836d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout runs 193 significant 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 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9550c0ae6f00595a1826d9bfe261cecf70a62870396f56d8b01e7c27d4eae804"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.apply_overlay_cursor_move: MethodTooLong \u2014 apply_overlay_cursor_move runs 189 significant 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 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"af72112849e8f256287ed6924ea2a91b205677268c3bd4448693366782a84a94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.paint_ready: MethodTooLong \u2014 paint_ready runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_ready.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5cb2e2e3c90968e09c84fb7cddf8d3139b946337a357c0e5e8b5b27b4851e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_host::runtime::network::owner::run_inner: FunctionTooLong \u2014 op_collab_host::runtime::network::owner::run_inner runs 185 significant 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 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/owner.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7cad862c2c4401e907e4233abc3ce6d50269e0c673fb621e716bdf98a0cc0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_text: MethodTooLong \u2014 apply_text runs 185 significant 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 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7725ef4cd87a5154cb2d7d0fb8e67f7ae547f8cd67355ecd50f84380871074"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pkg-ck/op_host_web.js: FileTooLong \u2014 910 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: __wbg_get_imports (31-892). The bar is 500 significant lines; this is 410 over it, 1.82\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/op_host_web.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678cc600d95ef4b6d4fb02a292c90e48ba642d5f19b7d5b3ebcf1e257c5d5dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_backspace: MethodTooLong \u2014 apply_backspace runs 180 significant 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 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_delete.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b46b5d065758487df33efdea82e58a14968e4ee7704f19c290ee82764d64f1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_send: MethodTooLong \u2014 apply_send runs 179 significant 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 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_send.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35ded540370cb16ccbfe7498a508ce60007d2419d6af89d591f808af471d7b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_art_screens::paint_order_screen: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_art_screens::paint_order_screen runs 177 significant 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 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cfeaddb6f0e62bbfc3119ead8d779b2661b9ba843636435db0dca2e4c0637a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GitRepo: TooManyMethods \u2014 53 methods, declared across 7 files: src/merge.rs (11), src/status.rs (11), src/remote.rs (10), src/lib.rs (9), \u002B3 more file(s). The bar is 30 methods; this is 23 over it, 1.77\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":"crates/op-git/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9ed084767cbf4443c7499146dc4ef6fa3f143a27ea925ba5051890121c8f08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeLoginViewController.buildLayout: MethodTooLong \u2014 buildLayout runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/NativeLoginViewController.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e588b8cab5799943dc3b0b223932f4533a1e9ad99db4c88b9ab92809320037"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::mcp_serve::registry::rebuild_registry: FunctionTooLong \u2014 op_host_services::mcp_serve::registry::rebuild_registry 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":"crates/op-host-services/src/mcp_serve/registry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c89bb1e2b192b1a21e3b2efa0772a507f9baea34c97f460e4cda2cbee55ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_desktop::design_session::apply_progress: FunctionTooLong \u2014 op_host_desktop::design_session::apply_progress runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec639c4ba1ceabc707f9d75a607f3a7fa6c72673916d590cb4a86330305ca0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpPlayerView: 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":"packaging/ios/Sources/OpPlayerView.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51d4160887fc088f51109ec8bb0e54eda9e7ef76f33a76424fd964e694ae759"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GitPanelState: TooManyFields \u2014 52 stored fields beside 5 methods. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/editor_ui_state/git_panel.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedb11cd2caf932721b07dafd80e75d1cd5b5af526da0fd1c13b0f5c3cfd6a24"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AIChatPlaceholder: TooManyMethods \u2014 51 methods, declared across 3 files: widgets/ai_chat_panel.rs (38), widgets/ai_chat_panel_hit.rs (12), widgets/ai_chat_panel_footer.rs (1). The bar is 30 methods; this is 21 over it, 1.70\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":"crates/op-editor-ui/src/widgets/ai_chat_panel.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8503d1b42e5cfb504b40cc8affc04ec3174bede4051d69ce7af9d2ac58f473c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OwnerSessionCore.handle_submit: MethodTooLong \u2014 handle_submit runs 170 significant 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 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/session_submit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a54a8f2f4d54b593da8b6a9429768589100ad58512ff9cfef0d19f5e18c276"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::role_defaults::role_defaults: FunctionTooLong \u2014 op_orchestrator::role_defaults::role_defaults runs 170 significant 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 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_defaults.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f296f68138d88345903dbf7da2597583e96a6f9d0e486c01fdf711a4b7169cbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::chat_click_flow::apply_chat_hit: FunctionTooLong \u2014 op_editor_ui::widgets::chat_click_flow::apply_chat_hit 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":"crates/op-editor-ui/src/widgets/chat_click_flow.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5d81a4dee92be2407732446564c46673366e26c0c37c9a16f4e91656898c51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileMenu.paint: MethodTooLong \u2014 paint runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/file_menu_paint.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa1aa248e78528f67cccce984bb9d89fd582d45985211186575dbcddf58f107"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.cursor_move_property_overlay_tiers: MethodTooLong \u2014 cursor_move_property_overlay_tiers runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_overlays.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec073e2fb4463414fb3b3d9ed883def0623f2a61dd2ea865c8c11287a6c0b872"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_desktop::persistence::run_action: FunctionTooLong \u2014 op_host_desktop::persistence::run_action runs 165 significant 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 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/persistence.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c2b0918dcd6635be62e184ca2fb996cd7e2d2eac58b4d87c47f99345f03c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImportWarning.ident: MethodTooLong \u2014 ident runs 165 significant 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 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/import_warning.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a688e7f41a6fa7e4ab91e62db452fdb5365c4f2da71c0a215e209081d749d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_web::canvaskit::mount_keyboard::register_keyboard_listeners: FunctionTooLong \u2014 op_host_web::canvaskit::mount_keyboard::register_keyboard_listeners runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/mount_keyboard.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfb622d30add97b88f89ebf7b8969e6ca4669d05acc41f765cf9348c86a2b47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_core::command_node::builders::build_leaf_node: FunctionTooLong \u2014 op_editor_core::command_node::builders::build_leaf_node runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node/builders.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"62930c06ca528f8cf729e4457a071aadffe457eeb9f0fb9286daf0407ecb3f74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: figma_temp_worker.workerSource: FunctionTooLong \u2014 workerSource runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/figma_temp_worker.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"160d749beae89ee660166776cd5a5aa74b270c4acdff70671b58382b00934487"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::cleanup::run_cleanup_passes_with_summary_and_policy: FunctionTooLong \u2014 op_orchestrator::cleanup::run_cleanup_passes_with_summary_and_policy runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"effb0d0ccb7942ec59e98eb6e47d4bde89093df07d607c7924dc8b63c45766b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AuthCodeFormViewController.buildLayout: MethodTooLong \u2014 buildLayout runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"39905f1e4ffc8422de8756d2ef4aa4105c6b8c90ec2b280c02b16deee7402ae3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_text::paint_text_section: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_text::paint_text_section runs 161 significant 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_text.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0da5d74e33027143855b7e20bdc31ae753fa68d100d46bd9bab29cf97edea73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.paint_menu_modal_and_panel_layers: MethodTooLong \u2014 paint_menu_modal_and_panel_layers runs 159 significant 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 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/paint_overlays.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"344edc39007da440d68bf1cb9bbea4590ef650d24f58d3996b80af3b5ecd8f97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::mapper::map_element_scoped: FunctionTooLong \u2014 op_html::mapper::map_element_scoped runs 159 significant 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 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85d591a61e9951d722607c308c3e340bbfa68892fd781c2637f560b334da934"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreviewSession.reconcile: MethodTooLong \u2014 reconcile 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":"crates/op-preview-core/src/app_mode.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3147a0608a2be7d6b477d6c5a89eae2b0c0ad1556c240de34921cadc046c76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorUiState.close_preview_owned_overlays: MethodTooLong \u2014 close_preview_owned_overlays runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_escape_transitions.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84a2f20ee0278c2bb0829a8ae9d142a9c8883d99fdd6104b6ed8b40d64b5519"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GuestSessionCore: TooManyMethods \u2014 47 methods, declared across 3 files: src/guest.rs (30), src/guest_sync.rs (13), src/guest_pending.rs (4). The bar is 30 methods; this is 17 over it, 1.57\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":"crates/op-collab/src/guest.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3911d4eaf9feb020e469bd37f9852aa7e55c849b01386203f489a259d37659a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VariablesPanel: TooManyMethods \u2014 47 methods, declared across 3 files: widgets/variables_panel.rs (45), variables_panel/hit.rs (1), variables_panel/hover.rs (1). The bar is 30 methods; this is 17 over it, 1.57\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":"crates/op-editor-ui/src/widgets/variables_panel.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f3a57e77d359f7f1b7f1578e879cbe9c9d5cb09e3a715d5edb7265efde18cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_relay_server::connection::relay_paired: FunctionTooLong \u2014 op_collab_relay_server::connection::relay_paired 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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1ffbde8aa36c9f2e577dea25dcdd86b1144b96e2de95de9941cd41110cc732"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_figma::instance::assignment::seed_assignments_from_instances: FunctionTooLong \u2014 op_figma::instance::assignment::seed_assignments_from_instances 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":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba4de161359fe4c6a07f081dbe3c25feff934b5f502894e66a82e2d9057f0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route: FunctionTooLong \u2014 op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route runs 155 significant 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 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34396a5c08f2f15ba5aa4a678313fdd546fc492c93215af47fbf58826ef79e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_host::runtime::network::guest::run_inner: FunctionTooLong \u2014 op_collab_host::runtime::network::guest::run_inner 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":"crates/op-collab-host/src/runtime/network/guest.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee34c7c62f230b8d846df3539de35cdeb66430fa5585e7a2090cc9f27b85d604"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.cursor_move_floating_panel_tiers: MethodTooLong \u2014 cursor_move_floating_panel_tiers 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":"crates/op-host-native/src/widget_host/cursor_move_panels.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fc5f31ef62aebd58a53763375c5caf57cfb8b5114e9188bea11e7b59d15f79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::cleanup_equalize_siblings::plan_family_repairs: FunctionTooLong \u2014 op_orchestrator::cleanup_equalize_siblings::plan_family_repairs 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":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"809ee096fd00369d94422fca435114a6d3cad53e9c2ee15d35b34d5b97ae94e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OwnerSessionCore: TooManyMethods \u2014 46 methods, declared across 5 files: src/session_roster.rs (17), src/session.rs (10), src/session_undo.rs (10), src/session_sync.rs (5), \u002B1 more file(s). The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/session.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b792f278aa112860c8446c0a7387614ed23e9da48f4863985a7bb7180179f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TopBar: TooManyMethods \u2014 46 methods, declared across 5 files: widgets/top_bar_geometry.rs (28), widgets/top_bar.rs (12), widgets/top_bar_window_control.rs (4), widgets/top_bar_paint.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fda7ed453c1ba833597f417fe378710f7f42aa65faa99001147fbe0a08cf428"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeSnapshot: TooManyFields \u2014 46 stored fields. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_snapshot.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796100c34b6be3aab353591e7af9f4b6acdbfb90b64a4fa92ee160b73eafdf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_press_inner: MethodTooLong \u2014 apply_press_inner 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":"crates/op-host-native/src/widget_host/press.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"504291c3a43a6d4507f910c84959a86be919b80b6e49b90795211ef2846dd774"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::mcp_serve::read_http_request: FunctionTooLong \u2014 op_host_services::mcp_serve::read_http_request 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":"crates/op-host-services/src/mcp_serve.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"922f8f366112464ece8e5fc5c1572024c398c1c3afc979a7c3c5dd2c2b2de0b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_image_popovers::paint_generate_popover: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_image_popovers::paint_generate_popover runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2de24bd2f6a42a8559134c357070504b996e44089977796460a7c03ab78722"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeLoginOverlay.buildContent: MethodTooLong \u2014 buildContent runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2148170c87ab42a13a196a2f9cb3b355073e55cb7f81001083d9a89ab0eaf809"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Icon.paths: MethodTooLong \u2014 paths 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":"crates/op-editor-ui/src/widgets/icons.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"25770da22b31326b2f3278a0ed2d88624b630087998e78951559e9e009881ef7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assets/snapshot-extractor.js: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e64dff9ee9fc9d3cc5b22650cfbb6037800c9aca84dde935971bb6b8401239"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_engine_napi::bindings_editor: TooManyFunctions \u2014 45 free functions. The bar is 30 free functions; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-napi/src/bindings_editor.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e449eac149bc04c9fcc288ee41f3a3c897dc94bbaf27e6d029c702c14c6968"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.handle_menu_action: MethodTooLong \u2014 handle_menu_action 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":"crates/op-host-desktop/src/menu_action.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9afc04d90624730180f81c10e3992fd9269d962d6e934306c6c9226ea7b0f44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_mcp::codegen_plan_store::submit_chunk_result: FunctionTooLong \u2014 op_mcp::codegen_plan_store::submit_chunk_result 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":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a8e356883eb2d90c9bdae1594dc500b8ddceed23137426158907f361298e99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_smoke::fault_owner::retry_exactly_once: FunctionTooLong \u2014 op_collab_smoke::fault_owner::retry_exactly_once 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":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b73bfc705ec6adf89b77cdd1e44c16ee8c7b44cfa8bf11b075c6a8b6e2352e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.paint_branch_picker: MethodTooLong \u2014 paint_branch_picker 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":"crates/op-editor-ui/src/widgets/git_panel_menus/branch_picker.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9050eb7c111c4225e6d4388e46d26c52eac12673d2048ff0bb3d6d5c824242c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Icon.from_name: MethodTooLong \u2014 from_name 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":"crates/op-editor-ui/src/widgets/icons.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b2b8df5c3c3ffbe2e40ffa4a6c4f1cd71f16163fa1094aeb7cfbf939d6f63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::plan::build_fallback_plan: FunctionTooLong \u2014 op_orchestrator::plan::build_fallback_plan 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":"crates/op-orchestrator/src/plan.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8adca518a4b85a3c40a9c3290698898347b9c11a882c1d843a6de721db44fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PromptCenterPanel: TooManyMethods \u2014 44 methods, declared across 2 files: widgets/prompt_center_panel.rs (33), widgets/prompt_center_panel_paint.rs (11). The bar is 30 methods; this is 14 over it, 1.47\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":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb631bacb9accaf3bfa713c0a66a03929db7be7e6baa952227480d43a4186bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorState.cmd_set_node_layout_prop: MethodTooLong \u2014 cmd_set_node_layout_prop runs 146 significant 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 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_layout_prop.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"058744fb8a63969532c6aecf8f4c0c374b019c92f50a10cda54f9f08822a4cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_host_core::codegen_session::run_pipeline_with_model_and_cancel_token: FunctionTooLong \u2014 op_editor_host_core::codegen_session::run_pipeline_with_model_and_cancel_token runs 146 significant 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 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/codegen_session.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c741209abe0f4bff9e2f2662234fd254f232a6bdbcbdfbae566dd2b9391ebdda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::canvas_viewport_text::paint_text_node: FunctionTooLong \u2014 op_editor_ui::widgets::canvas_viewport_text::paint_text_node runs 146 significant 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 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_text.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc91de43b3ccc2c39796f2a523cbc9d1984bde980846191fec71811bb7ff067"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard: FunctionTooLong \u2014 op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard runs 145 significant 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 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7124b11a5d0ff0c0fd298ec560cbcff02b39d040613a2338705a22e2f3b97e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_canvas_server::handle_web_canvas_request: FunctionTooLong \u2014 op_host_services::web_canvas_server::handle_web_canvas_request runs 145 significant 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 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2c9dafdf7de2c293f6a6aad4ab188282e0d855072d6816c20e9d910c35ffc0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.on_left_press: MethodTooLong \u2014 on_left_press runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac96fdde2456053ac297d15034637d04d5876784a7c22936f8e43e29e9ef87d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComponentBrowserPanel.paint: MethodTooLong \u2014 paint 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":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4512f01eb1158c48e0e058b6f39421f85cd423238864344a668103d014e9eea9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.resumed: MethodTooLong \u2014 resumed 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":"crates/op-host-desktop/src/app_handler.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"081488631e284d0712114eb20f6bae2dc272b09683567452caee0c4be1ecebce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.press_canvas_select_tier: MethodTooLong \u2014 press_canvas_select_tier 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":"crates/op-host-native/src/widget_host/press_canvas_tiers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d055f52a2683c18a006df1b5dc783b89dcdba8ccf074982ced85761fcef4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.cursor_hint: MethodTooLong \u2014 cursor_hint 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":"crates/op-host-native/src/widget_host/cursor_hint.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff02b03193d33584acb388b5a89faf7cd3230a7f91d912cf0866ed095bc7886"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_commit::property_focus_initial: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_commit::property_focus_initial 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":"crates/op-editor-ui/src/widgets/property_panel_commit.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a045bc449c3ac65d4e53d2ba4c94f52c2fe18b71d5154b842f0dccb0109985"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_core::svg_import::path_data::parse_path_d: FunctionTooLong \u2014 op_editor_core::svg_import::path_data::parse_path_d 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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4696bd286119b76dc8ddfa7076ce761d82947b05ac6675d6f2de3ce63a97d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::repair_record::describe_command: FunctionTooLong \u2014 op_orchestrator::repair_record::describe_command 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":"crates/op-orchestrator/src/repair_record.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870e7302b498965d2b70d148d30acbf5b50947fbec7dea5f030e927db5b71a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch runs 138 significant 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"64df76a0ddd41e59693688e0c7389a175f552167753a586addeca1289bd4cdf4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.apply_escape: MethodTooLong \u2014 apply_escape runs 138 significant 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_escape.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98a7c6aab14911642803ae91e6f10dd383ffd21077d4bb699977afd716e56d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::compact_prompt::build_compact_planning_prompt: FunctionTooLong \u2014 op_orchestrator::compact_prompt::build_compact_planning_prompt runs 138 significant 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/compact_prompt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f254285382e3462c22e10b772aa9fb0ad5def0c8247c2271a4837da1c98b2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card 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":"crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"35532df5fad72e6a79ad301a31cb039cdb7c6e5be75b72d4ab7fc91959c4dabb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CanvasKitBackend: ClassTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 2 blocks, lines 24-716. The bar is 400 significant lines; this is 147 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/backend.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de8ebd45f573ceedb41c35db0960f88d4f611a5f223eda144ed84fd27c26d9d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatState: TooManyMethods \u2014 41 methods, declared across 3 files: chat/session.rs (29), chat/messages.rs (11), src/chat_design_apply.rs (1). The bar is 30 methods; this is 11 over it, 1.37\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":"crates/op-editor-core/src/chat.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d245b0d4cf39a84e0d15c2f726a07a0947442e0d54fa4a48bef2cabddd9752a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StudioPalette: TooManyFields \u2014 41 stored fields beside 3 methods. 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":"crates/op-editor-ui/src/widgets/home_surface_palette.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fbae3e38cbbbe047dc18c321168c57f0cc39cbac8dc8ddce6b77ce37e1e3dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: VisibleSections: 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":"crates/op-editor-ui/src/widgets/property_panel_visibility.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee3e80bfcb1896a7c8d52f8ec5596f62a3abc888d3f7cf452907a79ff829c8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AuthCodeFormOverlay.buildContent: MethodTooLong \u2014 buildContent runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f160df3d4ed80a102196edc2518a4fb5dd6afc46d32e9bf02bcae1c905c943"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_desktop::chat_session::execute_tool_requests: FunctionTooLong \u2014 op_host_desktop::chat_session::execute_tool_requests runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1841afce0bea534907ee5fe488fc43ef7ef9e4b6e260f9dc74643aeb6cbe2a62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SectionCapabilities.for_kind: MethodTooLong \u2014 for_kind runs 135 significant 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_visibility.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b2f13c1c520b447d51d45a942a01a07b85c408a4c73172eaebfbda7c5049c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::project_zip_range::parse_html_zip_central_directory: FunctionTooLong \u2014 op_html::project_zip_range::parse_html_zip_central_directory runs 135 significant 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip_range.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f800548654cdbc2236a8deeb66c907fec2fd3b9cf894ecf1d26878d5379009f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.dispatch_variables_panel_press: MethodTooLong \u2014 dispatch_variables_panel_press runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_press.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff687a1194330b715176d60fd952b0cd417f2c50de9c4826418c6542317c87c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_desktop::chat_acp::run_acp_turn: FunctionTooLong \u2014 op_host_desktop::chat_acp::run_acp_turn 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":"crates/op-host-desktop/src/chat_acp.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac04ce1ae293c1323a7260f9c673a42093c52aff7c0bed17e66c01d260cb08e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::workspace_surface_paint::paint_toolbar: FunctionTooLong \u2014 op_editor_ui::widgets::workspace_surface_paint::paint_toolbar runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/workspace_surface_paint.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1c6fa9826bc577f1083d480968aac44ad11b7d2f70d831078fccec6dbadf42"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CollabRuntime: ClassTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 101 methods, 3 blocks, lines 72-799. The bar is 400 significant lines; this is 126 over it, 1.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":"crates/op-collab-host/src/runtime.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8109b1172534577bbd9124e99ba3168fdbdaa211b25dfb348e4b488c625667"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreviewSession.paint_framed_animated: MethodTooLong \u2014 paint_framed_animated runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/transition.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d8b38549ce69224203bc208ad9ff77e9c4ce4ec60c4fe9cc48a48853c6df07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: picker.startPick: FunctionTooLong \u2014 startPick runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/picker.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f59a417b8eaeaeda014a3cf269fb71abcf4a346bc3559029583d2e62a0ba20b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodegenPipeline: TooManyMethods \u2014 39 methods, declared across 3 files: ai/pipeline.rs (28), ai/pipeline_rescue.rs (6), ai/pipeline_chunk_helpers.rs (5). The bar is 30 methods; this is 9 over it, 1.30\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":"crates/op-codegen/src/ai/pipeline.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f505fe6e29646d62c765742db78e496290940e2b79d2719c149f8254f4151f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_chrome_extension_core::design_md_validate::is_valid: FunctionTooLong \u2014 op_chrome_extension_core::design_md_validate::is_valid runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62a4c53d9eed2c07a3b9f1c499347da8b043e9f526547f1956ed5323d2e7ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fault_owner.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":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2627590491d2b2765dadeba4933d98cfcca13ac71b5c4b0b773b2dd8fbf1c8cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth: FunctionTooLong \u2014 op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth runs 129 significant 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 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_ui.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c945b699ddc26507c0f2ab921f94adac53841476e85bd2c93d13c9979bc1ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::workspace_surface::layout_for: FunctionTooLong \u2014 op_editor_ui::widgets::workspace_surface::layout_for runs 129 significant 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 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/workspace_surface.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"544819a8dad89dee09294621d31a8edcd69eff18a6c467fad93611d1840ea706"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeFrameBackend: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 14-710. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/frame_backend.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"721def21526fc3fc97cf0530b5b9b4c3cdff272239c6ff124421e8f5a1110389"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.cancel_native_touch_gestures_inner: MethodTooLong \u2014 cancel_native_touch_gestures_inner runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/touch_panel_gesture.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2430273e992b4faff48529014e1eb6715f2db8732edd2d287c5580e262e6c144"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_chat_standard::stream_new_design_route: FunctionTooLong \u2014 op_host_services::web_chat_standard::stream_new_design_route 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":"crates/op-host-services/src/web_chat_standard.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06579a6d9d7e01286c637a33364f48471f1faad6877ba7a7f1be2d1e8b283d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_pen_loader::layout_scene::node_payload_to_scene: FunctionTooLong \u2014 op_pen_loader::layout_scene::node_payload_to_scene 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":"crates/op-pen-loader/src/layout_scene.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd1e0b51e2a92d94267a10fad9e2fb009db650abe9439aa6c0b4600a3af4270"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_editor_core::host_keyboard_transitions: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_keyboard_transitions.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"73081a56dd5c51e28ac3421d261922ef941a6ec5d7cd83030a056a4f533c3eff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpEngineHost: ClassTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 400 significant lines; this is 105 over it, 1.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":"packaging/ios/Sources/OpEngineHost.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"286e9c829e142a0ba023b9e24b219782ae1483925431af449cac7af844d35a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.press_home: MethodTooLong \u2014 press_home runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/home.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f24d6121fccfcda7f4be1d5c2ad8109c2d27f4bdd088f8a6a7f20b29c30b9dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_release_with_viewport_inner: MethodTooLong \u2014 apply_release_with_viewport_inner runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/release.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec8080e55656ef65b0ad1e781d42baaf100b6fb3a5a88aae1f673688ff00205"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::ai_chat_panel_paint::paint_examples: FunctionTooLong \u2014 op_editor_ui::widgets::ai_chat_panel_paint::paint_examples 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":"crates/op-editor-ui/src/widgets/ai_chat_panel_paint.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a1744479f1799e8e2203d8253237d195360d3922a0d6d59caaf53ac0efab37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::map_placeholder::build_map_placeholder: FunctionTooLong \u2014 op_orchestrator::map_placeholder::build_map_placeholder 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":"crates/op-orchestrator/src/map_placeholder.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b51663aac09e12aa59fee199306a391b360b27dc7aefe0bdc12a4cad6aa1b1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HomeLayout: TooManyFields \u2014 37 stored fields beside 2 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_layout.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cc442cf3dbe2f53ea65e2a685ee5c21d9b6c14eee786d3f17040af160b7e9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_input_layout::push_fill_action_rects: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_input_layout::push_fill_action_rects 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":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53d99c68c8476f6f75a312fdd99bb7c0c3b537d6c48e185399e4ad03d7135c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.update_dropdown_hover: MethodTooLong \u2014 update_dropdown_hover 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":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2128f1aa97533472af11cc2f32f43e1a6eced03d6f73b422d47f24d4d7b0f4e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_mcp::paint_server_row: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_mcp::paint_server_row 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":"crates/op-editor-ui/src/widgets/agent_settings_mcp.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0f60bb712428a73fc27cdf2abd1bd4af66253e8fbf3932086177764f63fe5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit 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":"crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"444a8addbfeb4da741b87bb19b3ab8b77520d3ec3330c90be265ef213fe60b21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_panels::paint_preview: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_panels::paint_preview 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":"crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"b789c8c54768059b7a8b84eed63ae5a06f6648c968ae7331c2d22e47c74ed046"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpPlayerView: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 87 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/OpPlayerView.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"847ad1992640cd4b2d63620dda0543a693d0b357d4384a836018d5eb00bd0b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GuestRelayRuntime.start: MethodTooLong \u2014 start runs 121 significant 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/relay/guest_runtime.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efb563514a48e993b80b5a9b7aeeb266e1e7841acd4cfb2a52baa42f73b6f9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_smoke::owner::serve: FunctionTooLong \u2014 op_collab_smoke::owner::serve runs 121 significant 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/owner.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86615556433e259bcb4e18cb0c51aacc2cc61e7225ecdb9d5bb968f5f0f2667"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_desktop::design_session_workers::finish_design_success: FunctionTooLong \u2014 op_host_desktop::design_session_workers::finish_design_success runs 121 significant 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session_workers.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dfaa3121676664dd3ef10898efd34393c371ee60bb776d6b400cce2f062d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::validation_fixes_b3::build_container_node: FunctionTooLong \u2014 op_orchestrator::validation_fixes_b3::build_container_node runs 121 significant 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_b3.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4b5203d681100261b80747605cdfc026a7b7942fb36ca32009143a7bfc200"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/design_md_evidence.rs: FileTooLong \u2014 601 significant 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 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_md_evidence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcea3629b12474c2d6f2d630e2b354c143f609b565ebd003fedc8919165a42a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_cli::app_control_cli: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/app_control_cli.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"caafd70c9899abc0e186f664da379c852f58c0aea73dabf6411816dd3a20719c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_design_lint::node_util: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b5f9650d0edcc41106790b3d1ddd813de24fd24a10ecbcf48e8583818a7087"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ComponentBrowserPanel: TooManyMethods \u2014 36 methods, declared across 2 files: widgets/component_browser_panel.rs (21), widgets/component_browser_kits.rs (15). The bar is 30 methods; this is 6 over it, 1.20\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":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"75282b753b6a79bc3d64b504911d6bbfe05ae0e8a56b421f41886f35b3d4f4ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_orchestrator::validation_dump: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_dump.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5d17f83c5c0ae41af2f81664afe6dfa4cbb392f44b7cbc6b3169356d1bb346"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PenSession: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/src/session/pen-session.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32f335e1f76d31e322d07c656bee4d6cf006d49b43246007b8c23d61ab963e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_relay_client::session::pump: FunctionTooLong \u2014 op_collab_relay_client::session::pump 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":"crates/op-collab-relay-client/src/session.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4d1548d63827c504b11204730f6a081cf4ea98885412f1ce156649f34d68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_smoke::fault_guest::retry_exactly_once: FunctionTooLong \u2014 op_collab_smoke::fault_guest::retry_exactly_once 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":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55ac08244e0ace98244ff441ff88dde55a739281711cabc50618a93c82cf2f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::hero_bleed::enforce: FunctionTooLong \u2014 op_orchestrator::hero_bleed::enforce 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":"crates/op-orchestrator/src/hero_bleed.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"97458c59811d65f293404cab9df3cabeb4ec6be8ec4270e18407ff7a7716aef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command_apply.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: EditorState (49-798). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_apply.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b5612df6406e6f3d6aefd6edb3382f56397a4d27921d1785f3be00358ca009"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: variables_panel/paint.rs: FileTooLong \u2014 595 significant 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 95 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel/paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f69e0b603b2ce802aab75387a210c07e188d7acc0200d9a9ee0331ad37d846"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_host::runtime::network::connection::drive_guest: FunctionTooLong \u2014 op_collab_host::runtime::network::connection::drive_guest 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":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b47a62c1c49b8f172736fd5b376275c8063ca9f3e3f82cbafbe67b43f9f316d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.hit_test: MethodTooLong \u2014 hit_test 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":"crates/op-editor-ui/src/widgets/git_panel_hit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb0146f522083d13a1b0134e30d8b2829403f2f3683e0ff5db75820152716de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_settings_images/paint.rs: FileTooLong \u2014 594 significant 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 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"848d45fe024c7e3916d09e7c73be759d46e62afe39245e66644b05e874e62429"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/property_panel_text.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":"crates/op-editor-ui/src/widgets/property_panel_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81dce19bc7d4b7dfe6b184318b3c7d6f2f0c35daa2ed6a0377ea71c60756f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopApp.new: MethodTooLong \u2014 new runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_state.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46bc0cb5a1219dce71781b07d6167110e192952a3b8011fb5c44f3b0b9e495c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LayerPanel: ClassTooLong \u2014 471 significant 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, 3 blocks, lines 78-793. The bar is 400 significant lines; this is 71 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b9ac5e86548e3a99fc255e51635f57ca213ac4a46b45714390d5264832bf73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_relay_server::connection_wait::wait_for_pair: FunctionTooLong \u2014 op_collab_relay_server::connection_wait::wait_for_pair runs 117 significant 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 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection_wait.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"626852d66d6f19e2ca9670f95167c44db5510c209b5fda5ca45a0fca3d55fb6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.paint_tracked_picker: MethodTooLong \u2014 paint_tracked_picker runs 117 significant 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 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_tracked_picker.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f47227d05c6fd2db3d5ac3e52c29a43b9ac550a9d35faf2b93c7fd876f6a17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_wheel_inner: MethodTooLong \u2014 apply_wheel_inner runs 117 significant 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 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/scroll.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"716ddcea3f7d30eeaf9fff5306410924f4926839d2baca33bb64aa221f81ab6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_mcp::batch_program_exec_ops::execute_image: FunctionTooLong \u2014 op_mcp::batch_program_exec_ops::execute_image runs 117 significant 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 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_program_exec_ops.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa50b6b070355d8bcf04ac2b5a595caf8a6f1d18e9fdc93317923363a4109b8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeLoginViewController: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 67 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":"packaging/ios/Sources/NativeLoginViewController.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee383f8d8c218c6d6e28b6a2038da2abb17c671e0234610fdeb4cfd02a4746a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_html::color: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; 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":"crates/op-html/src/color.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3df26c6c5922e48a6d808de4f33f9495c7b47be198a7ff1cb3f005f6e2155c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_html::css::selectors: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; 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":"crates/op-html/src/css/selectors.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1b6081d9bbed38f724a9b9ff27479634ae1d94443b1281a2a07a743213e331"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_orchestrator::motion_recipes: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; 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":"crates/op-orchestrator/src/motion_recipes.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf38f75d8dde2da5c288f8c82d9ced8e81517c74d45ea54bc146801882868755"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 582 significant 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: CollabRuntime (3 blocks, 72-799). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1601a7530e80dee44e6d0b90d409d981c07320ddc7b95d35ceb3140e7199e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_settings_builtin.rs: FileTooLong \u2014 582 significant 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 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d3a270809804c6f135c5c01cce1b07e209b972f8ef8aadb143a648768bb74d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/converters.rs: FileTooLong \u2014 580 significant 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 80 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/converters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b897f9e653d9c381a6d664b5bc68fc3435c7a775b5b7e152a04526ebed80d5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_engine_ffi::editor_chat::execute_tool_requests: FunctionTooLong \u2014 op_engine_ffi::editor_chat::execute_tool_requests 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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"968603831a1574469a174e7fc776854730f27f6cd7b3adb94d86192372eaeb43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_web::web_settings_storage::load_into_with: FunctionTooLong \u2014 op_host_web::web_settings_storage::load_into_with 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":"crates/op-host-web/src/web_settings_storage.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f552211a2d9cb6da90a3d987eb08b0cd035e2d9c724761b977a61c59e6b912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/web_chat_standard.rs: FileTooLong \u2014 579 significant 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 79 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_chat_standard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbc92aa085b9030ebf613b59368d1d65e9ea8617fef93f2621033668653851c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/workspace_surface_paint.rs: FileTooLong \u2014 576 significant 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 76 over it, 1.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":"crates/op-editor-ui/src/widgets/workspace_surface_paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47213efe0feebf3c9824d62c406249294e6e2efbbeef3b16d1a8362acb30e597"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mapper_visual.rs: FileTooLong \u2014 575 significant 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 75 over it, 1.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":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7ecfcd4d046844711b861a376e61a0bd461f88cd5559e635473a14061ab277"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropertyPanel.hit_test_action_logical: MethodTooLong \u2014 hit_test_action_logical runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/hit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b12704598b5663585c6b34e2577549d180e04d2ab20efd60dbe713ea5a168d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_engine_ffi::desc::parse_create: FunctionTooLong \u2014 op_engine_ffi::desc::parse_create runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/desc.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e92ff4e0d10d816d0a0fbaa11b70fe66598a0794f35ac976766c4b4d441b34b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::mapper::container_props_from_impl: FunctionTooLong \u2014 op_html::mapper::container_props_from_impl runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beac3691a91ca6f1fa1c67f44b04c21e928e4b6c2d5845cf0f69e43401d78d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::radial_repair::radial_stack_repair: FunctionTooLong \u2014 op_orchestrator::radial_repair::radial_stack_repair runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/radial_repair.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c71e48f1cd9bdd0e5b8b92ee78a6e06e2ba87a16ae3d3344c0681dd2cbc21de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/declarations.rs: FileTooLong \u2014 571 significant 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 71 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b888424583e0816830f29bc86c60b5077a1143c76e664b618dc5f773481ed6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_art_screens::paint_menu_screen: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_art_screens::paint_menu_screen runs 114 significant 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 14 over it, 1.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":"crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"748c6c2c4613400a12168cf067b29a7403c6bbe1faa4256d75ae6322ed105f30"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_cards::paint_explore_card: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_cards::paint_explore_card runs 114 significant 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 14 over it, 1.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":"crates/op-editor-ui/src/widgets/home_surface_paint_cards.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d298db5fb3a08f3d371e8cb53fc1faee96777bce8f42bc72c8ebab1e19c0d0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::workspace_surface_paint::paint_header: FunctionTooLong \u2014 op_editor_ui::widgets::workspace_surface_paint::paint_header runs 114 significant 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 14 over it, 1.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":"crates/op-editor-ui/src/widgets/workspace_surface_paint.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef6d56125357bc7098d98e4a47efc943efcde627fe563bade8e93d707f79c02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_figma::instance::apply::apply_to_node: FunctionTooLong \u2014 op_figma::instance::apply::apply_to_node runs 114 significant 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 14 over it, 1.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":"crates/op-figma/src/instance/apply.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddae0a4e5432c64fec055f0fc9c008a8bacdff83d961a7e25fa5bda4e3d7673e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_canvas_server::online_run_loop::serve_one_online: FunctionTooLong \u2014 op_host_services::web_canvas_server::online_run_loop::serve_one_online runs 114 significant 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 14 over it, 1.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":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"89db8abad47a7c8ac96dab2c8edeb673a07afb099cdf24707aa467aeca0fedd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImportWarning.fixed_message: MethodTooLong \u2014 fixed_message runs 114 significant 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 14 over it, 1.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":"crates/op-html/src/import_warning_display.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"edff2a35fa874d67f44a8fba79d414c036640d78832797f8f154417a9eb51383"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: canvaskit/backend.rs: FileTooLong \u2014 568 significant 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: CanvasKitBackend (2 blocks, 24-716). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb18eac2a847f7b048a7674c4123d379dd40ffde028b385d804cae0bab6cfef1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_editor_core::agent_indicators: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/agent_indicators.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"194f8e0edf20bbf8ef1f39edc2a3bd6ba6d27f3e2fd101a1153b5fb756e87910"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_editor_core::command_style_replace: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"631aad7ab3f6a81ebc3ec683aeecbbc70e1d033eeccb8f60fbb48d276684f5d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_host_desktop::mcp_integrations: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1fc43ed9984d0c2d0010b965aeadbc0bccd9668a93490759a6f9cb5d3544ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_orchestrator::orchestration_self_check: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e6f06e360164aec1966e12568f3f4dd80edd117b9d7840e5c215f6b7e63e26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/property_panel_dispatch.rs: FileTooLong \u2014 566 significant 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 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49041902e91083d24ca27e69a61fc8dd2a0dc25f23a50590f1fa08d63ea3ee2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_builtin_form::paint_field: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_builtin_form::paint_field runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff98bb89260b4c22d78095ca6cc2840b10a5e04c75d60e8ae1aaf7e8fed008c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_images_parts::paint_search_input_row: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_images_parts::paint_search_input_row runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb95c70acf1c90d91747f5f34674664ece4b688fed7043e6becd6552f191ab3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::ai_chat_transcript_design::paint_design_block: FunctionTooLong \u2014 op_editor_ui::widgets::ai_chat_transcript_design::paint_design_block runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c3ceb3f9fa9fa3f6100d6d4e2a32f293ef5886a796119df1337fc1362befa5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a54ff66d4f7b56f7c9a75e503200a109839639623040e33154ee9f60cd68bf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_desktop::chat_session_launch::launch_if_pending_inner: FunctionTooLong \u2014 op_host_desktop::chat_session_launch::launch_if_pending_inner runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session_launch.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"60df8dcc7c7778e7be9caf32632940e30919a158984b91598d594b8b922847e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CollabPanel: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 3 blocks, lines 81-648. The bar is 400 significant lines; this is 50 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3fc46ffb8310c8d74c5f799822aa480b9ad6476d9becc00115d8580dc70f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/icons.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: Icon (2 blocks, 33-608). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/icons.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"743a1ad0d919f068b1347e54f505da13de8ccbf9ac33c01f8f0c3e65aef5ad58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp_live/design_md_route.rs: FileTooLong \u2014 562 significant 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 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_live/design_md_route.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc72078fc4f1d2c3ad64d29faf474fd4381f37a3a1a597cf2d2d47d8e47e51e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Icon: ClassTooLong \u2014 449 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 2 blocks, lines 33-608. The bar is 400 significant lines; this is 49 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/icons.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d33e5464062f63b90421bb4a0826e76deb6260a666b1d76f94316cfec24ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_effects::paint_effect_row: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_effects::paint_effect_row 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":"crates/op-editor-ui/src/widgets/property_panel_effects.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7ec9e1f8c21a8d27a9fcd863d0716310ad2f6e5c868a7dd956a24dc6bd330"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_canvas_server::online_run_loop::run_online_web_canvas: FunctionTooLong \u2014 op_host_services::web_canvas_server::online_run_loop::run_online_web_canvas 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":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8148c533a4ec4a40c8c8ee2e4722adc108cb2356fb8d2cf10c0761c52c3f2d06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::scaffold::mobile_status_bar_json: FunctionTooLong \u2014 op_orchestrator::scaffold::mobile_status_bar_json 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":"crates/op-orchestrator/src/scaffold.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae0715cafb7d0692076a5f4a35624ae0b94b7fdd82f0d611e2cadf236f08d3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_settings_acp.rs: FileTooLong \u2014 558 significant 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 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39ac3d83991e6da3c1786762f2dddaf825a71848f8dedca54838f56f0e31ab1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/property_panel_sections.rs: FileTooLong \u2014 558 significant 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 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_sections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7154a04e2a2245a4b403db3c9778a36e59824936089efe2b19d368912a8ee23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/relay.rs: FileTooLong \u2014 557 significant 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 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f948e068ebf8778ecb45ee98d424fe6be8950cf1dac83f03f2a8c6334e8ba0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codec.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/codec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81a3e1b89dd2234de0ab333bf18af1f69f82c985e711958fc3eb851b158af9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bindings_editor.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/bindings_editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc1345f8bf8bad94c8dec38cdffa994b8f40a615e414327cbf09fd30c27a529"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/special_image.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe473509d7643fa0dd55bc683624a4c39c9d21ec7ee0559b1747f317448bf8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodegenPipeline: ClassTooLong \u2014 444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 2 blocks, lines 65-751. The bar is 400 significant lines; this is 44 over it, 1.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":"crates/op-codegen/src/ai/pipeline.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0420484edb0992268d7354c782a7a3d61c7c473bc6bb645fcf811869b957feac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/discovery_bonjour_browser.rs: FileTooLong \u2014 555 significant 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 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/discovery_bonjour_browser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc32b5591d3273556a009663a3d16383c9f381e54bbe08cdc71db425cb07fbec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/layer_panel.rs: FileTooLong \u2014 555 significant 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 85% of them inside a single declaration: LayerPanel (3 blocks, 78-793). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b41e7a49f00358c799eb1eafcd89c36e45e56811e21e82925f1cf6ebc5a565"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::agent_settings_images::paint::paint_profile_header: FunctionTooLong \u2014 op_editor_ui::widgets::agent_settings_images::paint::paint_profile_header 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":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"498f49bcd018b0db6c13ab955d07d80382c9b7b59b192a26083691224575c617"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComponentBrowserPanel.paint_kit_strip: MethodTooLong \u2014 paint_kit_strip 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":"crates/op-editor-ui/src/widgets/component_browser_kits.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3230cec2e869219232b280b516a89583522528da7c3d9cbcd8734f0c66d41f21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.press_property_panel_tier: MethodTooLong \u2014 press_property_panel_tier 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":"crates/op-host-native/src/widget_host/press_property_tiers.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfea456ddb45deda7c272fc0efb40896ff1264ea654b4657a77d64e239aae71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHost.dispatch_variables_panel_press: MethodTooLong \u2014 dispatch_variables_panel_press 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":"crates/op-host-web/src/widget_host/variables_panel_press.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"752ffc3a4b46f340510eba14d2f59df4806289b2187b1841ef56254875d12ec2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/radial_repair.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), declaring 32 free functions. 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":"crates/op-orchestrator/src/radial_repair.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b9e073cb19b7f51791883a634cb224fb050e5baf9b89055c17578ad7dbb233"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CollabRuntime: TooManyFields \u2014 33 stored fields beside 101 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b7f125ba70c43943de3443bf8648a42234a04b32a94fa044160dcb23df1451"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AIChatPlaceholder: TooManyFields \u2014 33 stored fields beside 51 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5add83f593a261fbcc83b03dd837e108765016e240912d13f73f819e712f7207"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebSyncClient: 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":"crates/op-editor-core/src/web_sync.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"de49e869f704134e6814c2e42da66c8301c22d2904ce0e0680526eefb83f64ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_host_web::web_fonts: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; 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":"crates/op-host-web/src/web_fonts.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f64792aa3c0ad6c5a7e2c8c0c068c22c2ce6150b18aaa323111f09e9f7fe2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PropertyLabels: TooManyFields \u2014 33 stored fields beside 1 method. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_sections.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a14057d850a34837359f26bf83ae13d19c425b51f8c3cf62fc69e6864d578e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/property_panel_flex.rs: FileTooLong \u2014 550 significant 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 50 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":"crates/op-editor-ui/src/widgets/property_panel_flex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19918e12134ee71084304d6967599eabaf72602826429bfc4fa595f9edf4b46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/cascade.rs: FileTooLong \u2014 550 significant 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 50 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":"crates/op-html/src/css/cascade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8b4fdc2bb4b9ce1a5225b386ad578d21afa2faeec1210e6fd1a3015b0a40b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke: FunctionTooLong \u2014 op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_image.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8c038a111c08d06c35c690c1adde28727c18105effc009049cc377fcad1de1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VariablesPanel.hit_test: MethodTooLong \u2014 hit_test runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel/hit.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda30c34f7357b97b9253c049327893dc63b14fc3d4c0fc13cf5003051901d9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_figma::converters::convert_vector: FunctionTooLong \u2014 op_figma::converters::convert_vector runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/converters.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5b2955eb33f50da88e0026aff93435119f08e01c78e9e67ab84c29fa460c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.cursor_move_modal_tiers: MethodTooLong \u2014 cursor_move_modal_tiers runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_modals.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d7aa30b25648af2b7cd2eb8a97a4bbf49c2e52d7d6bee7ae509889fe8c06b0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainActivity: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 38 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/MainActivity.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a53ab39a0b6befe28b99d419e6ceba716e6f4b223114cf11c18fb864be02766"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Sources/OpEngineHost.swift: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: OpEngineHost (6-739). The bar is 500 significant lines; this is 46 over it, 1.09\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":"packaging/ios/Sources/OpEngineHost.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0d83da64f80c3aaac7579ee26328cc00eda7d8b7a0f25c5a960afaf704ce10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_sections::paint_position_section: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_sections::paint_position_section 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":"crates/op-editor-ui/src/widgets/property_panel_sections.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f4558bed4c36eccb5d2398463f1ff209ddb404a080737360539f7d3603b95e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::special_image::map_image: FunctionTooLong \u2014 op_html::special_image::map_image 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":"crates/op-html/src/special_image.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"253ee548c8afffe98b7464a7674c594b6fa4eb97a3401a11d4ec6c30c531edec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/discovery.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/discovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fad251c18164b96c9504a420950ca11264cd86284b71bf3dfd7321c0eade37"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConnectionDriver: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 3 blocks, lines 129-687. The bar is 400 significant lines; this is 32 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":"crates/op-collab-transport/src/driver.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"eede80a0121eb1d8e58963f6d02e4b100f1a7f1e6ea0010ae0e0965050d24c72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_art_screens::paint_home_screen: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_art_screens::paint_home_screen runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fecb2c1ecdffd0d817bae930f1493af5ce9070f894fdb465c3deefd62e7f8d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.press_menu_modal_tiers: MethodTooLong \u2014 press_menu_modal_tiers runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8745593b15313882754b21f0674edfe56b9d85488dba00ec58f46266db62b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/relay_bootstrap.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/relay_bootstrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7639cab403e2990af6cf20d5ddb1f89a93180f689452b0b15d77ead08fe27a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/property_panel_code_complete.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_code_complete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf4fa7c80ff193b393a08f3c4fbcf4c03a5ae4d07f3b8cbe069fd9021fcd0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skia/path.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: NativeBackend (53-701). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"127ecccc9570ce7a9dea8354d037af8a076b12b747a4c26b3f1fc761a0068eb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mobile_more_panel.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/mobile_more_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b01e567cd5297b145d37f0b5e96dc5831ded4450916d719266f2891ad2f5c51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/animation.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/animation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c45627cc2bab71f66bd1c409cc8cf090067e695e1eaf83091debc2b604fd7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/debug_trace.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/debug_trace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d58c721f943eb24c96df776f741fcd6788e25ca2d0ce63bf9f2bd4401cdc8fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vector_decoder.rs: FileTooLong \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). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd5623afe1f462ed148e7e3bb4523c82cef894b4b0e0c023b6557fca9fa1c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/property_panel_code.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8586f86b5f1155777ceac82387f2b8ed34194a1465ea409de88f699e7fa07bc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/motion.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b92672e89f903a9910f7d5c96170ea302e6f8b2257798a9e11dc701ab38f9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorCommand.collab_gate_action: MethodTooLong \u2014 collab_gate_action runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/collab_gate.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4fe845414ce26a90138e60b58a427d8102fda5f6c69bce47dcdad6f17fa28d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_figma::instance::swap_filter::filter_swap_stale_derived: FunctionTooLong \u2014 op_figma::instance::swap_filter::filter_swap_stale_derived runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/swap_filter.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"710abd6ff1a72dba9147d21622417f66abde85817e3d22be361bf508f01dd873"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.press_mobile_more_sheet_tier: MethodTooLong \u2014 press_mobile_more_sheet_tier runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"124cb853090dcc14677509902e33e6bfe6e4627f93cd5b286471734c7dd9111d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::resources::embed_node_images: FunctionTooLong \u2014 op_html::resources::embed_node_images runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a76b18493eebf219c041589f055d8a2ffc20ef13d6d073e9c8b2ef147a4cb2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::style_guide_context::build_planning_style_guide_context: FunctionTooLong \u2014 op_orchestrator::style_guide_context::build_planning_style_guide_context runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/style_guide_context.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"44077db7d24bc4120d093371ff04a55ab9a7bed14972dcb7712d74266e4b1ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_chrome_extension_core::design_md_validate: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 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":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aa6f295b91977bb58bb0bf4d336c48cb39c8dba8351577b301c4c0420265c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectionDriver: TooManyMethods \u2014 32 methods, declared across 2 files: src/driver.rs (21), src/driver_queue.rs (11). The bar is 30 methods; this is 2 over it, 1.07\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":"crates/op-collab-transport/src/driver.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e06a619b5cd631d377819fcd59561f890629418e4eea767ec7cfc0555cdc683"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_orchestrator::cleanup_mobile_chrome: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 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":"crates/op-orchestrator/src/cleanup_mobile_chrome.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20da198e7a2e9f08872ba5073a14269093f6598a588252a9300c90beea95cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_orchestrator::table_repair: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 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":"crates/op-orchestrator/src/table_repair.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea91cf70fdc4652931fed61633ba3cd08da8366d63efff56d04ce170606d1c27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/property_edit_mutators.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: EditorState (57-739). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"320be8bcdc4336df8435c1b11983f072310660163ad88f2857c74cfc7caecfad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mapper_margin.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 30 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":"crates/op-html/src/mapper_margin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6668e47dff49ef8c924ea29a5bf2d2b7c545c6ce334eee7021ba0912598ada70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpSurfaceViewEditorTouch.editorTouch: MethodTooLong \u2014 editorTouch runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceViewEditorTouch.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a038f28d2de676d070576b2b1b4cb656a56bdd47b90392f18f2ea5244d58aec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::ai_chat_transcript::paint_transcript_with_selection: FunctionTooLong \u2014 op_editor_ui::widgets::ai_chat_transcript::paint_transcript_with_selection runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ae77fb835de39fb488f80915afb643666fc9079858add17894dba3d8a5786"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_mcp::batch_page::command_with_outer_page_id: FunctionTooLong \u2014 op_mcp::batch_page::command_with_outer_page_id runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_page.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c078f605c9a51a99b20b024a4260711bc59745ee78f807fd34d93d7cb62cd85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/variables_panel.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: VariablesPanel (3 blocks, 127-776). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0295c3e09500576ba29cf304e94b95d9c4cb78a3fbc3ba3c73bd3d7d1c1b75f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpSurfaceView: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 400 significant lines; this is 22 over it, 1.06\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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceView.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4171b18743cf8742216bff292208d3a9190f207fa4a57494c555c9f0a33bc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/snapshot.rs: FileTooLong \u2014 527 significant 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 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"462b43fef7a2f80fd61a77c644a598067475d0aa84befd98de1725c2a860082d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VariablesPanel: ClassTooLong \u2014 421 significant 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, 3 blocks, lines 127-776. The bar is 400 significant lines; this is 21 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/variables_panel.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea250ea17e6a4c5da37378650e02af8957468e019b5a142922d029fd2c5a639"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/home_surface_paint_panels.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d1c9a203283e7232af258ba150427c2b84ff7e853df593a40b5c9437637af2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.paint_remote_settings: MethodTooLong \u2014 paint_remote_settings 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":"crates/op-editor-ui/src/widgets/git_panel_menus/remote_settings.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9181219be2b859380db0d2904618174d3eb689f67deb3f8bd078eec770dcb1ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.apply_pan_gesture: MethodTooLong \u2014 apply_pan_gesture 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":"crates/op-host-native/src/widget_host/scroll_pan.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5355a946e4d2e516c559374aa5a47a5fc10ae3c211114d05f98e3b978b84f523"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_html::special_image::parent_content_box: FunctionTooLong \u2014 op_html::special_image::parent_content_box 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":"crates/op-html/src/special_image.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa333a477c10356dade7a2beb7852a310edb1c6185d44d72e583776d894f3c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 65 methods, 2 blocks, lines 29-718. The bar is 400 significant lines; this is 19 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/lifecycle.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d62822f758dde6262adf2257c5345ff04b18ef49f25b7c3b0473a2011d84c39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/ai_chat_transcript_design.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). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58afd1cc4f6238d49bea6b402d496fcba973cce5959ca096ea0a5bf6d549d253"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widget_host/cursor_input.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 99% of them inside a single declaration: WidgetHost (14-762). 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":"crates/op-host-web/src/widget_host/cursor_input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2c987d89f541d8f9724905e3a6e9591681edf3f03c656a8f7603400e3f2f50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout_scene.rs: FileTooLong \u2014 522 significant 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 22 over it, 1.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":"crates/op-pen-loader/src/layout_scene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbad394084deb1a1d55436151f258462330575274ad6fdc455a36354009be7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/driver.rs: FileTooLong \u2014 521 significant 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 83% of them inside a single declaration: ConnectionDriver (3 blocks, 129-687). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17440c912bb5209d8c89c18594adffa2e2b12e0ab4b7a65164f178219e77b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widget_host/touch_panel_gesture.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: WidgetHostNative (48-738). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/touch_panel_gesture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfdfe7ea6d2e18ad003e02c55b085a8b357aa1d492ab61d95408ed5b7163f37"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubprocessProvider: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 4 blocks, lines 64-792. The bar is 400 significant lines; this is 16 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f0c107f34117bb3f86a912f3636609ca4b7039c5033bee35f470bffd01ed8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/connection.rs: FileTooLong \u2014 520 significant 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 20 over it, 1.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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"961ac6189e50c194b37452add4bc5d9d167bdf335fbac221d4ea8639f97085d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_collab_host::runtime::network::connection::drive_owner_peer: FunctionTooLong \u2014 op_collab_host::runtime::network::connection::drive_owner_peer 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":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e5a2e1fec833995efeafab6ce4db4239c989adde81b922bb8fa5ba1e4e9993"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_core::scene_template_catalog::parse_scene_template_catalogue: FunctionTooLong \u2014 op_editor_core::scene_template_catalog::parse_scene_template_catalogue 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":"crates/op-editor-core/src/scene_template_catalog.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaf8889da14473ad4c7ad3231eef3f5ce6d22dc6bb2a3df9e1cfbca0600f3f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_copy::task_copy: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_copy::task_copy 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":"crates/op-editor-ui/src/widgets/home_surface_copy.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a0df0fcf4889c84b2f219dadb6f3a372862b61cffb955e7a146f3058bd209"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetHostNative.press_variable_value_cell: MethodTooLong \u2014 press_variable_value_cell 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3332ce9b68243472272f5c9523a57d5f8c63dabeaf103de5f43c74bbbda43d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout_repair.rs: FileTooLong \u2014 517 significant 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 37 free functions. The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8692e2134319d5f61f5f6dd75ce0700234aa7afd95070fab6126e763750ed9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GuestSessionCore: TooManyFields \u2014 31 stored fields beside 47 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":"crates/op-collab/src/guest.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a1ad5fdf4cc27012a3bb16e41ff82eb56bfe5cf0a1c98a2917a02a8f2968f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ChatState: TooManyFields \u2014 31 stored fields beside 41 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":"crates/op-editor-core/src/chat.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05e7f6ce07749f24e408fe146e1f8014b9801c4d04f3d0e24eade808a1bcdad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MainActivity: 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/MainActivity.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd849fd9a75c1c7c7b1f89f8cc2e293ce7c28904d7cfe7294ade4258ad7155ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: op_design_lint::detectors::spacing: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; 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":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c806a736f017ea27731572f17e0f74877e86d7c7192b9c83795e5e2ba4bd6e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/ai_chat_transcript.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c423ba9691f5625f81aca27df402cf8afb8c8a399854821c38096eaaa4f23055"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/frame_backend.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: NativeFrameBackend (2 blocks, 14-710). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/frame_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"485be7610a7a0c713a7143df2984625ace160082044f880e2dcbbdd8630cc21b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Sources/OpPlayerView.swift: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: OpPlayerView (10-745). The bar is 500 significant lines; this is 15 over it, 1.03\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":"packaging/ios/Sources/OpPlayerView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bb2fac08e3e9024423be69a26d4db213145d5a145947d4b658c0e837cdc164"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::property_panel_video::paint_video_section: FunctionTooLong \u2014 op_editor_ui::widgets::property_panel_video::paint_video_section 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":"crates/op-editor-ui/src/widgets/property_panel_video.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb1e6a98b086b3ba0b28b582cfa8b8637acdbbbef3b6636e341089d5c8efcae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_web::live_sync_glue::push_document_if_changed: FunctionTooLong \u2014 op_host_web::live_sync_glue::push_document_if_changed 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":"crates/op-host-web/src/live_sync_glue.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"3225fc351a6752bd4ffbdd40abd3852734422ab7aa1fe02c8a60bb0f43e57e4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_mcp::codegen_plan_store_assembly::assemble_plan: FunctionTooLong \u2014 op_mcp::codegen_plan_store_assembly::assemble_plan 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":"crates/op-mcp/src/codegen_plan_store_assembly.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e9110273ba164617f5a485595ed52fbea2e6d98d26e8d83009d145cd66a38a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::loop_finalize::fix_theme_variable_polarity: FunctionTooLong \u2014 op_orchestrator::loop_finalize::fix_theme_variable_polarity 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":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e065b4096d37e766c6adba92cf93b7c29c56bac6ee686a326786de5ca4f83c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DirectOpenAiClient.call: MethodTooLong \u2014 call 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":"crates/op-smoke/src/llm_clients.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24848e96ed4334c37e06bc4f7c3e39ab74a27a939c0c9dcbe462e3bc3959184"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resources.rs: FileTooLong \u2014 513 significant 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da610a1940e93ec49936dfeaeb89fd15c050cbef246d7ae7876cfb7e6c7a628"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mapper.rs: FileTooLong \u2014 511 significant 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 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42d91ef101f5bd1bc425870aa76d5ddf42fd0223b4c45d77c2c8b59310150a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/collab_panel.rs: FileTooLong \u2014 510 significant 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: CollabPanel (3 blocks, 81-648). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd0be5eada9b2ded255289a20154f2a0f3d09b30c71f42c4c0f167affd6eee1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GitPanel.paint_diff: MethodTooLong \u2014 paint_diff runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_diff.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ce3572b72c54d341e9ac7afe8a1f4253f5b82985eb3df75967196a3a989a47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_ui::widgets::home_surface_paint_art::paint_phone: FunctionTooLong \u2014 op_editor_ui::widgets::home_surface_paint_art::paint_phone runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_art.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3cdc7a977f1ea3e3c1d908a40f8452cbd159a5ebddf767be64ac39186b513"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_canvas_server::run_loop::run_web_canvas: FunctionTooLong \u2014 op_host_services::web_canvas_server::run_loop::run_web_canvas runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/run_loop.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cb805f09047f50dbf7418bd14278d525d7ae2b47615a2aa3f191675b30a2fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_chat_standard_events::progress_label: FunctionTooLong \u2014 op_host_services::web_chat_standard_events::progress_label runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_chat_standard_events.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec252d36e0eaa541f71a982f54676cc0963717d035c1dc500da0ccf35a146c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_orchestrator::concurrent::run_screen_groups_concurrent: FunctionTooLong \u2014 op_orchestrator::concurrent::run_screen_groups_concurrent runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78a888499cb39cf652a83a3b135f012049a05e8bafa1741764ac7c84e9f5b3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/selectors_parser.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: Parser (2 blocks, 72-470). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2edb3129ab55669a99ec68a748fdc1f405a4cfa0ce23945a111224149faf33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/admission.rs: FileTooLong \u2014 506 significant 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 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/admission.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dff10c4bf827cf2aece05bf031f38150cea71e77e55fe87bf19dbc9d954453"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeLoginOverlay: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6534fbbcf82912bd12ae1718f208f55138808723d3a4bb443a735afba9523c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_editor_core::icon_path_normalize::absolute_segments: FunctionTooLong \u2014 op_editor_core::icon_path_normalize::absolute_segments 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":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2109d3658c1b70732aa3feebab32d71763aa421ebd5a4616c7f6a7991435540a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: op_host_services::web_credentials::validate_and_merge: FunctionTooLong \u2014 op_host_services::web_credentials::validate_and_merge 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":"crates/op-host-services/src/web_credentials.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"13adf96b87851e22b98ddcfa399536bb2f8efda5669aaf7458a0cd6fabfda477"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/binding_overlay.rs: FileTooLong \u2014 503 significant 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 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/binding_overlay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab39032b2215a555be5c059dccd1b47318fbea701d8f46fab2f9313e16339a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 13 shared lines): crates/op-codegen/src/lib.rs:252-274 | crates/op-design-lint/src/node_util.rs:413-435 | crates/op-editor-core/src/fills/access.rs:12-34 | crates/op-mcp/src/style_ops_tools.rs:432-454 \u2014 These 4 members are variants of one another: a block of 13 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 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/lib.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"927681df5d00aa9b556b5b1c457412fa06d3edc6fb344a243406c66808a28475"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (144 shared lines): crates/op-chat-agent/src/chat_agent_loop/openai.rs:40-363 | crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:83-401 \u2014 These two members are variants of one another: 144 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":"crates/op-chat-agent/src/chat_agent_loop/openai.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d05911987d595ace3e5be865723d7024e0c39e1320dcf8b862b4b0b2c722165"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (72 shared lines): packaging/ios/Sources/AuthCodeFormViewController.swift:68-267 | packaging/ios/Sources/NativeLoginViewController.swift:102-327 \u2014 These two members are variants of one another: 72 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":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"321ef0218541762b9d29a02708674ca61614cd309b61fe75c4fb5371882c9c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (66 shared lines): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:73-244 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:164-351 \u2014 These two members are variants of one another: 66 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d2c0688c743af65fa6683bf3ca025c9ffa1ed5582aae768e6a8a28b3e33895"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (64 shared lines): crates/op-collab-host/src/runtime/network/connection.rs:48-186 | crates/op-collab-host/src/runtime/network/connection.rs:195-353 \u2014 These two members are variants of one another: 64 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":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"94370eaf3a2fe314cc5850a0ff1327d7fef15b1fe86f56fd8df6fda6c4bfe1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): crates/op-collab-relay-locator-server/src/http.rs:400-458 | crates/op-collab-relay-locator-server/src/http.rs:466-528 \u2014 These two members are variants of one another: 49 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":"crates/op-collab-relay-locator-server/src/http.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eb3e98e55639b9915bdc317c1d7aab2e1b687bc226b9827bffaa4ae60f0d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (47 shared lines): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:243-361 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:218-311 \u2014 These two members are variants of one another: 47 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4792ebbf546cee389d9113a9cc16538358d64b70a858f1bac52e1daf347cc2bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/op-host-services/src/web_canvas_server/run_loop.rs:28-197 | crates/op-host-services/src/web_canvas_server/online_run_loop.rs:128-297 \u2014 These two members are variants of one another: 44 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":"crates/op-host-services/src/web_canvas_server/run_loop.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba79786154a646bfa87561b98d779cfb6c945ce5f13b767be0ddf372c637541c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): crates/op-editor-core/src/svg_import/path_data.rs:12-192 | crates/op-editor-core/src/svg_path_data.rs:55-168 \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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b609b4afa70ec18ab0d6f6e4ddea8363815894bf6350a6c871e81414a7fdb540"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): crates/op-codegen/src/codegen_html.rs:40-134 | crates/op-codegen/src/codegen_targets.rs:294-381 \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":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0ca9fbd3b643b79d8f704e124a4b55d14aa58716938ad7b64fb05621243441"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): crates/op-html/src/project_zip.rs:190-284 | crates/op-html/src/project_zip_range.rs:163-326 \u2014 These two members are variants of one another: 34 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":"crates/op-html/src/project_zip.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f870820f7855a2a3ea1e6bfa71f7f915db57ad87bca485929d4faf9c944dfc51"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/op-editor-core/src/instance_override.rs:91-154 | crates/op-editor-core/src/ref_resolve.rs:225-321 \u2014 These two members are variants of one another: 31 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":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1519d2d3bcf69f9c45d55bca935396dee357c974ecd68f659ccee4907887f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): crates/op-orchestrator/src/finalize_enforce_status_bar.rs:143-191 | crates/op-orchestrator/src/finalize_enforce_status_bar.rs:194-256 \u2014 These two members are variants of one another: 30 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":"crates/op-orchestrator/src/finalize_enforce_status_bar.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0e91be7a47bc7f80b327534549d7d815f435ef8ac711bf08a35f3eb473262e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (15 shared lines): crates/op-editor-core/src/fills/access.rs:89-111 | crates/op-mcp/src/style_ops_tools.rs:456-478 \u2014 These two members are variants of one another: 15 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":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4884642e9ecf3fd896b80b92c848cb73040899ade99801e410b0fa9abe18ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/op-editor-ui/src/widgets/drag_flow.rs:444-494 | crates/op-editor-ui/src/widgets/drag_flow_index.rs:343-384 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/drag_flow.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"949ae6b1f67099498c255f440b65fa5e26da1099f6302b4b20cc8a0dffdaa0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/op-editor-core/src/svg_import/path_data.rs:270-309 | crates/op-editor-core/src/svg_path_data.rs:416-455 \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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f30ea8dcbff6aee5642592bc0e70f443f597a4c68b6510f2e338e6bfbd2b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/op-html/src/css/declaration_syntax.rs:169-213 | crates/op-html/src/css/declaration_syntax.rs:287-325 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f08af2ee8af5e52e1a744685dae695723f7d417f0f860f26fe6660e7e666d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/op-editor-core/src/svg_import/lexer.rs:10-47 | crates/op-editor-core/src/svg_import/xml.rs:95-166 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80f52ad2300d29dd7ad58f6120aa78be776b2b532f3222ac6f9e6bfc939791a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/op-pen-loader/src/style_payload.rs:467-507 | crates/op-preview-core/src/session_paint.rs:533-566 \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":"crates/op-pen-loader/src/style_payload.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5a7a4db409c5de77a50d69d1dae65141e7eba364f607666bc1f4e5954267b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/op-orchestrator/src/orchestration_self_check.rs:349-361 | crates/op-orchestrator/src/role_post_pass/mobile_cards.rs:95-107 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e532db7e326ff58d01b1ddc440b9f02044ee66be85c1325c6a3b5822c55d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/op-orchestrator/src/loop_finalize.rs:180-189 | crates/op-orchestrator/src/role_post_pass/color_utils.rs:12-23 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"834f08be4f2263b64db4893ce09ebafe3e9f22cb2d5ded4426b35eafe376f1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/op-host-desktop/src/git_jobs.rs:94-107 | crates/op-host-desktop/src/git_jobs.rs:206-221 | crates/op-host-desktop/src/git_jobs.rs:244-263 | crates/op-host-desktop/src/git_jobs.rs:288-301 | crates/op-host-desktop/src/git_jobs.rs:344-357 | crates/op-host-desktop/src/iconify_host.rs:66-79 | crates/op-host-desktop/src/update_check.rs:102-115 | crates/op-host-services/src/acp_agent_probe_host.rs:106-121 | crates/op-host-services/src/provider_probe_host.rs:68-81 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/git_jobs.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abc09d17506a88f8f129a997a2be0a96dc454414de0009ea25067c9f923a9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): templates/step0/_generators/tpl_infographic_challenge.py:247-265 | templates/step0/_generators/tpl_infographic_concept.py:299-317 | templates/step0/_generators/tpl_infographic_data.py:290-305 | templates/step0/_generators/tpl_infographic_faq.py:237-251 | templates/step0/_generators/tpl_infographic_map.py:246-264 | templates/step0/_generators/tpl_infographic_ranking.py:273-287 | templates/step0/_generators/tpl_infographic_steps.py:221-233 | templates/step0/_generators/tpl_infographic_timeline.py:268-286 \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":"templates/step0/_generators/tpl_infographic_challenge.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"30363692d01d3c31b7f30081e588f5b8f9383a0da649cd9e5c4461f687d9f645"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/op-orchestrator/src/category_grid_reflow.rs:119-179 | crates/op-orchestrator/src/geometry_bottom_gap.rs:79-108 | crates/op-orchestrator/src/geometry_validation.rs:220-243 | crates/op-orchestrator/src/geometry_validation.rs:385-408 | crates/op-orchestrator/src/radial_repair.rs:431-451 | crates/op-orchestrator/src/sidebar_archetype.rs:17-34 | crates/op-orchestrator/src/stub_repair.rs:9-32 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/category_grid_reflow.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c732ca6206bd7d8a57cabece9cbfd0396cc9268a2b77c9e854ecaeb073e755"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/op-engine-jni/src/bindings_editor.rs:65-89 | crates/op-engine-jni/src/bindings_editor.rs:109-131 | crates/op-engine-jni/src/bindings_editor.rs:142-172 | crates/op-engine-jni/src/bindings_editor.rs:193-217 | crates/op-engine-jni/src/bindings_editor.rs:361-382 | crates/op-engine-jni/src/bindings_editor.rs:417-439 \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":"crates/op-engine-jni/src/bindings_editor.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b9f4a9e27d9e43f09b176b63d7d8bb14bc584aa1e87db4296549cf02acc490"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): templates/step0/_generators/tpl_cards.py:84-95 | templates/step0/_generators/tpl_journal_card.py:191-201 | templates/step0/_generators/tpl_lecture_light.py:155-165 | templates/step0/_generators/tpl_pitch_dark.py:143-153 | templates/step0/_generators/tpl_quote_card.py:89-99 | templates/step0/_generators/tpl_quote_card.py:103-116 \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":"templates/step0/_generators/tpl_cards.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aaa1c20320c146a8e384ca09db06727d557752f686b3245e05ff5943be3eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/op-editor-core/src/property_edit_mutators.rs:500-509 | crates/op-editor-core/src/property_edit_mutators.rs:511-520 | crates/op-editor-core/src/property_edit_mutators.rs:522-531 | crates/op-editor-core/src/property_edit_mutators.rs:533-542 | crates/op-editor-core/src/property_edit_mutators.rs:600-609 \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":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd613fb87a07dcbb187809f76cc771bab7aaff2b9a5e4aa8e9def1b7a897f031"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/op-orchestrator/src/absolute_child_clamp.rs:141-164 | crates/op-orchestrator/src/absolute_child_clamp.rs:279-302 | crates/op-orchestrator/src/none_stack_inset.rs:24-47 | crates/op-orchestrator/src/section_shell_fill_repair.rs:144-171 | crates/op-orchestrator/src/text_fit.rs:200-223 \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":"crates/op-orchestrator/src/absolute_child_clamp.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"126d6fb6d70961b212f6b9f52bb6672cadea6fd1038dddd7e871e91fb0427e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): templates/step0/_generators/tpl_bookreview_carousel.py:230-247 | templates/step0/_generators/tpl_cityguide_carousel.py:251-283 | templates/step0/_generators/tpl_opinion_carousel.py:211-221 | templates/step0/_generators/tpl_story_carousel.py:214-226 | templates/step0/_generators/tpl_yearreview_carousel.py:311-329 \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":"templates/step0/_generators/tpl_bookreview_carousel.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe283e391921a25759bb57a9252aed52501704737632e8963bb09579be069a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-ai-skills/src/style_guide/token_table.rs:493-523 | crates/op-orchestrator/src/design_type.rs:160-201 | crates/op-orchestrator/src/plan.rs:497-528 | crates/op-orchestrator/src/plan_fallback_card.rs:22-52 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/token_table.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc386fc03e60cb315a0d543395981ef5c102ef9c2e94279db55cc43e12a614d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-collab-smoke/src/fault_guest.rs:46-175 | crates/op-collab-smoke/src/fault_guest.rs:181-238 | crates/op-collab-smoke/src/fault_guest.rs:356-410 | crates/op-collab-smoke/src/fault_guest.rs:448-470 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"584e597dcbb9e161a4e8b9a0bad7e0db2fe39f546c9cf0996d9b7acfe8a453a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-design-lint/src/node_util.rs:555-570 | crates/op-editor-core/src/property_edit_mutators.rs:741-754 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:279-297 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:299-313 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adab556ca97779b7f1777fdecc862b22a689671f7ee9f32f7caa1d945a9d820"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-core/src/command_style_replace.rs:416-438 | crates/op-editor-core/src/fills/access.rs:157-179 | crates/op-figma/src/clipboard.rs:561-574 | crates/op-orchestrator/src/variable_binding.rs:284-306 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a20535e931499c4366054b4bd459b45c040e48f1a84e155051101232c9c2366"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-core/src/host_image_panel_transitions.rs:256-269 | crates/op-editor-core/src/host_image_panel_transitions.rs:278-294 | crates/op-editor-core/src/host_image_panel_transitions.rs:303-319 | crates/op-editor-core/src/host_image_panel_transitions.rs:322-335 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_image_panel_transitions.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b92b5af0748ef534c15e3824177d70cc4f95b42d64979faf016eeaf6d26951"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-core/src/color_picker_snapshot.rs:24-41 | crates/op-editor-ui/src/widgets/variables_panel.rs:327-348 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:378-394 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:320-336 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/color_picker_snapshot.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"66439158054941cf3561419037ecf24dee96280b3ef2eb1797b907c5cbecc634"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-core/src/image_crop.rs:224-238 | crates/op-editor-core/src/property_edit_mutators.rs:666-683 | crates/op-editor-core/src/property_edit_mutators.rs:702-719 | crates/op-editor-core/src/property_edit_mutators.rs:721-738 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/image_crop.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b7c293cf8d827ea29bba825802b8c80436dcc6b51a7db0f0545197ff5147e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-ui/src/widgets/property_panel_input_layout.rs:58-364 | crates/op-editor-ui/src/widgets/property_panel_layout.rs:226-600 | crates/op-editor-ui/src/widgets/property_panel_sections.rs:466-586 | crates/op-editor-ui/src/widgets/property_panel_sections.rs:604-705 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e50b5ccdb953a3f27a33f936a00a2e855462959239e790b67a7d841c4c9911"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:230-303 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:344-413 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:459-546 | crates/op-editor-ui/src/widgets/property_panel_layer.rs:167-265 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ba65d56ff1d95cf4e2f097737b21b07d4ee1e27585a4121401157f7b9338a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:159-182 | crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:196-219 | crates/op-orchestrator/src/validation_dump.rs:267-281 | crates/op-orchestrator/src/validation_fixes_apply.rs:558-573 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb04325d84573cbf39d185c6f32efc09a4dd63e589984f6216561ce77e8d5e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:184-207 | crates/op-html/src/mapper_node_access.rs:87-110 | crates/op-orchestrator/src/validation_dump.rs:283-297 | crates/op-orchestrator/src/validation_fixes_apply.rs:577-592 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c80895cf97864b52e9a2a48d95a01593b66ac0195272a1f67b3072a1563ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/op-mcp/src/batch_get.rs:239-251 | crates/op-mcp/src/read_nodes.rs:102-114 | crates/op-mcp/src/style_ops_tools.rs:157-169 | crates/op-mcp/src/style_ops_tools.rs:173-185 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff311b0bfe261147a4761b9fa8b8bdd0aab5cfb2eabd7a7f04df16609a41ee73"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): packaging/ios/Sources/DocumentExportCoordinator.swift:226-266 | packaging/ios/Sources/DocumentSaveCoordinator.swift:378-418 | packaging/ios/Sources/ImageImportCoordinator.swift:144-193 | packaging/ios/Sources/OpPlayerView.swift:375-407 \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":"packaging/ios/Sources/DocumentExportCoordinator.swift"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcb9d9b63c7da8747fef7a533d3d14d6deea6a428f2fb97639f66f04959e49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61\u201374 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:100-173 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:63-123 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ce49e9aa2b8372ad4cb9376906e4f6aafe24b7338cd01e94edbb50dfc4a727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint.rs:244-300 | crates/op-editor-ui/src/widgets/workspace_surface_paint.rs:274-330 \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":"crates/op-editor-ui/src/widgets/home_surface_paint.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2265b695ed3c1d7e7e839b051b006909e64150437639761ea59c5b624c8c5eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs:636-680 | crates/op-editor-ui/src/widgets/home_surface_paint_sections.rs:204-248 \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":"crates/op-editor-ui/src/widgets/home_surface_paint_panels.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a95e63c44b76869e4a19c56b72bfa2d0803a4425c43a7224e1c7141a2b37f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/op-editor-host-core/src/settings_io.rs:375-415 | crates/op-host-web/src/web_settings.rs:444-484 \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":"crates/op-editor-host-core/src/settings_io.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ed6137d153f7e7f5b0df4df43ca03fe7db71dbcbe1b6884a60acf221cfe007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): crates/op-mcp/src/write_tools.rs:67-105 | crates/op-mcp/src/write_tools.rs:541-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":"crates/op-mcp/src/write_tools.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f237d11c8f10b18f7ff9df5ba1b46eb890f8e9acfbd4d4c8798ed81082d226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:157-195 | crates/op-host-web/src/widget_host/preview_slideshow.rs:308-346 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"082b8c495089416fa63e1cef3704038d1df06c34b72ac62842c6019d13642dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 3): crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:178-212 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:301-336 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:367-401 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill_body.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"88031c88a8e905c93fa1049503e1d355631c0fe01d51cc00f9d66574eda025b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201336 lines \u00D7 2): crates/op-host-services/src/doc_io/clean_copy.rs:21-56 | crates/op-host-services/src/doc_io/clean_copy.rs:82-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/doc_io/clean_copy.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b14da3db1f7bef9f3039efcc7a4ef0e158eb199193497226f07ff149e425d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/op-editor-ui/src/theme.rs:106-140 | crates/op-editor-ui/src/theme.rs:146-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/theme.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a7696bdc3b7b4f931434c976885243ba4323cd9f9dfd3b45b8159fcb3b86ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201335 lines \u00D7 2): crates/op-host-native/src/widget_host/input.rs:249-283 | crates/op-host-web/src/widget_host/node_drag.rs:145-177 \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":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7f1151a0fe0dfad6cc7e1a866d05f231d4dc8ce4d2f16e691bc32a385711e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:138-170 | crates/op-host-web/src/widget_host/variables_preset_press.rs:88-118 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f5d3083d806b1fd97417893894d336cd6cee23052c2d5c0f85d13cafa91bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201332 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:272-303 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:370-401 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:498-529 | crates/op-editor-ui/src/widgets/property_panel_layer.rs:237-240 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9d553b7ea1185fa2cdeb444db251edf602445307260ee5131c31cbcaff1a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): crates/op-collab-relay-server/src/connection.rs:546-577 | crates/op-collab-relay-server/src/connection_wait.rs:97-127 \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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ce2252ee870030c85a41c88632880a7f1feca7e89c8f9e23b5e5980ec4538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/op-editor-ui/src/widgets/drag_flow.rs:456-487 | crates/op-editor-ui/src/widgets/drag_flow_index.rs:346-377 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/drag_flow.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/drag_flow_index.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/drag_flow.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f12d46de752ccc0b0098df4e219f0738dd5b82a9dc35771a0ae849c6c468d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_layer_bounds.rs:337-367 | crates/op-editor-ui/src/widgets/canvas_viewport_layer_bounds.rs:394-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_layer_bounds.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"df92806b2b9c7820187cae084842cec98aa3f039de53d64b7e969b4832c145ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/op-html/src/css/declaration_syntax.rs:172-202 | crates/op-html/src/css/declaration_syntax.rs:288-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3da92162b15a807af3ffee9b1e76b101ed5ad898d0a04ebb2a12519142754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/op-orchestrator/src/mobile_content_rail.rs:87-117 | crates/op-orchestrator/src/mobile_content_rail.rs:119-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_content_rail.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b7d5bfdd5b887d80f2326cd7532e17bcaf758e2167a471d36620e3f5cfe717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): crates/op-editor-core/src/svg_import/lexer.rs:11-40 | crates/op-editor-core/src/svg_import/xml.rs:96-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd5002ea481fbfc696ad659bb24f9c73058474c19a59106382f3e40527553ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/op-mcp/src/parser.rs:238-267 | crates/op-mcp/src/parser.rs:273-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea23a51dcf0b45c2bd4362c04c44259669e99e5965704551b17ede14c9b1129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): crates/op-orchestrator/src/plan.rs:499-528 | crates/op-orchestrator/src/plan_fallback_card.rs:24-52 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/plan.rs\u0060 and \u0060crates/op-orchestrator/src/plan_fallback_card.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e12a8425d33fadc0d833cffddb36bbdb25056c6e7a6ab186907327cd3080dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): crates/op-orchestrator/src/finalize_enforce_status_bar.rs:57-86 | crates/op-orchestrator/src/unify_shared_status_bar.rs:161-188 \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":"crates/op-orchestrator/src/finalize_enforce_status_bar.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a37a4efe0d95d16ec5addc282786393115130113070907f2d2fdb6b1bc52d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): crates/op-collab-relay-locator-server/src/http.rs:333-361 | crates/op-collab-relay-locator-server/src/http.rs:408-436 | crates/op-collab-relay-locator-server/src/http.rs:473-501 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-server/src/http.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f89cf676ce7a50415923669d1e1228507a41aa263e82106fbeb04a2d37e696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201329 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat_design.rs:100-123 | crates/op-host-desktop/src/chat_session_launch.rs:687-715 \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":"crates/op-engine-ffi/src/editor_chat_design.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb50f7a6987dd7b0f6a21ed8b587598b4c8777755789084f86ae69ce18bea1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/op-image-enrich/src/apply.rs:72-100 | crates/op-image-enrich/src/apply.rs:102-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/apply.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb6d673c32bea473e867d48bbe8bae4185e3ce51e7c32d49ceb54bfd522c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201328 lines \u00D7 2): crates/op-image-enrich/src/net/downscale.rs:194-213 | crates/op-image-enrich/src/net/downscale.rs:243-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/downscale.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"11340c823feb690ad3ee614733feb42d9580b04f4ee33dabd60d4fbccd003d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): crates/op-editor-ui/src/widgets/property_panel_fill.rs:531-557 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:203-229 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:392-418 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_fill_body.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150453f8048af2af7a8ff99c78ff019e0bc909086753038fd38b889d765a291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs:372-393 | crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs:477-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"969d5c0a89c75aed68b52da1b07d6939f567f8de6ab126f94cf57b76f4086cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/op-host-desktop/src/app_handler/scheduling.rs:108-134 | crates/op-host-desktop/src/app_handler/scheduling.rs:184-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/scheduling.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c760243bdc18932fd3eb5d49763589d47acb7211e190fcaf567e5bfd252cbcdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/op-auth-bridge/src/collab_claims.rs:354-379 | crates/op-auth-bridge/src/collab_relay_token.rs:168-193 \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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec06cd20c8fc0beede40c46f756743080fd18ffbbb3c82fb193567786c85fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_fill_image_body.rs:18-42 | crates/op-editor-ui/src/widgets/property_panel_image_node.rs:156-181 \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":"crates/op-editor-ui/src/widgets/property_panel_fill_image_body.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d80dc7fa734bb0bd9f2a0825f35d3772e05ad915ad5d964c100d7ea54a2c885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_text.rs:168-188 | crates/op-editor-ui/src/widgets/property_panel_text.rs:190-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_text.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04c2ef8dc1115667e8cade6572cde52749293c9b90709b901e8f30bd1a80b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): crates/op-editor-ui/src/widgets/scene_template_card_paint.rs:97-121 | crates/op-editor-ui/src/widgets/scene_template_card_paint.rs:505-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_card_paint.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"141698a7bee2f4825fd1df0f64a0588ab869d595f8fca262e97d68ab965728cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/op-chrome-extension-core/src/op_export.rs:76-99 | crates/op-cli/src/html_cli.rs:264-287 \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":"crates/op-chrome-extension-core/src/op_export.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f1d83a3c28926cff6753d42daef76c793cd96a909341db5b445aafa9d396f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:298-321 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:252-275 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b415bc99f7adf189381b0ebfc120eb757bc0439d9ce2f26fee8847314945f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/op-mcp/src/script_runner.rs:509-532 | crates/op-mcp/src/script_runner.rs:562-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fef0d0233f2e2a21b9644e5b59f6afec6017b652d4c4223c5a5c7d67f722e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): crates/op-editor-core/src/svg_import/lexer.rs:149-171 | crates/op-editor-core/src/svg_import/path_data.rs:280-301 | crates/op-editor-core/src/svg_path_data.rs:426-447 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/svg_import/path_data.rs\u0060 and \u0060crates/op-editor-core/src/svg_path_data.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88ad0a8c412f17cac4e830723838d253e3bb053514ce49b4a82a37f1d82092f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): crates/op-editor-core/src/path_bounds.rs:81-103 | crates/op-editor-core/src/svg_path_bounds.rs:83-105 | crates/op-editor-core/src/svg_path_data.rs:307-329 \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":"crates/op-editor-core/src/path_bounds.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d451685125d1e1825dfa248650d2dc00a5ec7f27a1e8cb436381bc27fe4879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_typography.rs:142-161 | crates/op-figma/src/clipboard.rs:472-494 \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":"crates/op-editor-ui/src/widgets/property_panel_typography.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1785753ecdbe8ce4166592234e44554bd705dc89c212240c957b026188a04f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/op-host-services/src/chat_builtin_http.rs:286-308 | crates/op-host-services/src/chat_runtime.rs:103-125 \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":"crates/op-host-services/src/chat_builtin_http.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"127297537b1fdab781ebea13d871addba786dd6d4a68d19ad11d68aa19fedf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): crates/op-host-web/src/web_settings_storage.rs:99-117 | crates/op-host-web/src/web_settings_storage.rs:137-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":"crates/op-host-web/src/web_settings_storage.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8752cb044c9c614d1068aa9b3c8fa49e733cd481539add7c1de00f1b3bf7fb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/op-orchestrator/src/validation_dump.rs:214-236 | crates/op-orchestrator/src/validation_dump.rs:364-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":"crates/op-orchestrator/src/validation_dump.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a47b9066c41e468dddb5cdd9a5eb4b64e66c1ffffb7864e118c298717e70a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/op-cli/src/html_cli.rs:153-174 | crates/op-cli/src/html_cli.rs:181-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/html_cli.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a61c5ff596ffc78818885899f24d91f744f6f23192e2488374ae171b176901e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/op-collab-host/src/runtime/network/connection.rs:153-174 | crates/op-collab-host/src/runtime/network/connection.rs:320-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e689fe7681ac21c6fcbf57bee512ddf2e45efe1d1b0d0f54264429925bfcf297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/op-engine-jni/src/bindings.rs:218-237 | crates/op-engine-napi/src/bindings.rs:229-250 \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":"crates/op-engine-jni/src/bindings.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2007dbcb8465212fdef60ab21593c6312b7f4c30e7a89891cb8857a87dc34d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/op-host-desktop/src/app_state.rs:442-463 | crates/op-host-desktop/src/app_state.rs:490-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_state.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dda07e36b36fda2ef9f9184a299eddf5081405b94f537576d71028eb6dc28c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/op-host-services/src/import_html_url.rs:254-275 | crates/op-host-services/src/web_credentials.rs:217-238 \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":"crates/op-host-services/src/import_html_url.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"04731d4ef17178b8adb3e3ce6ac1187e5ebfad02906665b09ae308435d4fdc21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/op-orchestrator/src/orchestration_self_check.rs:375-396 | crates/op-orchestrator/src/role_post_pass/mobile_cards.rs:22-41 \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":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"95317d6756d7ee763bc18147f7b706a23037f1112aae4028b3a383d63277fc4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/op-html/src/css/declaration_syntax.rs:178-198 | crates/op-html/src/css/declaration_syntax.rs:294-314 | crates/op-html/src/css/declaration_syntax.rs:353-373 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declaration_syntax.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"52acd93787b1b95be1e33ade2319159c08c1e6e27ad3dee73bccc44c66752560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/op-ai-skills/src/style_guide/design_md_import.rs:155-175 | crates/op-chrome-extension-core/src/design_md_render.rs:533-551 \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":"crates/op-ai-skills/src/style_guide/design_md_import.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e444794f9605007708eb17b164f3f4ec7923d502a835b8d824ad38453303ff84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/op-auth-bridge/src/collab_claims.rs:424-444 | crates/op-collab-transport/src/admission.rs:588-608 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab-transport/src/admission.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef902dee0d7c7942452d2f074e7846b7fe50a8653cdbd440e676ff1cadfb19a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/op-chat-agent/src/design_agent_diagnostics.rs:522-542 | crates/op-image-enrich/src/targets.rs:623-643 \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":"crates/op-chat-agent/src/design_agent_diagnostics.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e5a70b73c655d8146f6247a6ba440dcbff03d81d86006f94d50e72bf6d5cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/op-host-desktop/src/design_session_workers.rs:238-258 | crates/op-host-desktop/src/design_session_workers.rs:271-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session_workers.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"81295f44aaba13b1ffc27b320aa6db839d962436e41eaed61ae57a128a564b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/op-host-desktop/src/font_import_host.rs:38-56 | crates/op-host-desktop/src/font_import_host.rs:84-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/font_import_host.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af19a376e14ea03c547eb0191d026e379782dfc6450279c05f30c07a5435625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:178-198 | crates/op-host-web/src/widget_host/variables_preset_press.rs:120-139 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c0e7bff647359298f50b09bcdd5364884bcfe4b2410958bacdf1d421219db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:352-372 | crates/op-host-web/src/widget_host/preview_slideshow.rs:507-527 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"96958241ef00fcc27ef9b6b370a23e44943214bf275d799adcb14fd28043f6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/op-html/src/css/cascade.rs:626-646 | crates/op-html/src/css/declarations_deferred.rs:87-107 \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":"crates/op-html/src/css/cascade.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c8cd1c874de5efbba29f640deed620d0d057778f80c433e313d217bd30efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/op-ai-skills/src/resolve.rs:64-83 | crates/op-orchestrator/src/prompt_style_skills.rs:296-313 \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":"crates/op-ai-skills/src/resolve.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cee75733e7755f74c120ea8e818c5f1c03b161606d7157fb56592e91a04f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:257-276 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:206-221 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"079a2869213c703732539a690ef0cd9970709a00974a662550fde9936abb947e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-editor-core/src/chat/message.rs:112-131 | crates/op-editor-core/src/chat/message.rs:138-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/chat/message.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bacc4ef6414a6ce09e425907271b43ee8a97c31bd40059a5b8436e6ac3a638e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_icon.rs:107-126 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:551-570 \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":"crates/op-editor-ui/src/widgets/property_panel_icon.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0345836a20ca4ae5354b3e07bcad4dcd54856431910fff5ab6a8e40e0d000c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:45-64 | crates/op-host-web/src/widget_host/variables_preset_press.rs:22-41 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f9b081e05681f4604e34d2435d6f1170ea622cf207611e69e0ee8ca85bee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-host-services/src/export_html_structured.rs:106-125 | crates/op-host-services/src/export_pptx.rs:153-172 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/export_html_structured.rs\u0060 and \u0060crates/op-host-services/src/export_pptx.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_html_structured.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4c12b59c2858d71ed3153250fb33d6a9f5e799482b34166e50df8ffc4124e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/op-mcp/src/node_attr_tools.rs:246-263 | crates/op-mcp/src/node_attr_tools.rs:304-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/node_attr_tools.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f8f3a21d8bb655a0392365c4f4bc049acc027ae2cd333c3f720b5231d008b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-orchestrator/src/concurrent.rs:302-321 | crates/op-orchestrator/src/concurrent.rs:384-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b03d247df19dbf4adb654eb441aa5f15752f1ae40e00ed680dd24489d7bbff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:253-272 | crates/op-orchestrator/src/touch_target_floor.rs:206-225 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"91eebab60b954d7cccc680474ae8c59756bc576482039e21d08f9ef4a6355bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/op-pen-loader/src/adapter/entry.rs:28-47 | crates/op-pen-loader/src/adapter/entry.rs:67-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/adapter/entry.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d82231544718086c31a78df0772d152631e12b3ffd173e9c1383dd53cd81ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/op-pen-loader/src/style_payload.rs:470-489 | crates/op-preview-core/src/session_paint.rs:535-551 \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":"crates/op-pen-loader/src/style_payload.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf2a4eab39662b7c5bf13b017e15e0a54dce6e2e923d4674cead46dd26fbf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/op-orchestrator/src/validation_fixes_apply.rs:666-684 | crates/op-orchestrator/src/validation_fixes_apply.rs:686-704 | crates/op-orchestrator/src/validation_fixes_apply.rs:706-724 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c5c4c92518f9c34888569f5f7005a66c48d3af29ff97e5cebcdd9c900e6f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:326-344 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:284-302 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa876cd0582f61361ab0117842a156cdbd140648cf7663c5aaf392be867f6442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201319 lines \u00D7 3): crates/op-editor-core/src/color_picker_snapshot.rs:116-125 | crates/op-editor-core/src/scene_vars.rs:74-79 | crates/op-editor-core/src/variables.rs:60-78 \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":"crates/op-editor-core/src/color_picker_snapshot.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1fc35dc756a5a6f66aaf312ce7439d5cdb154bccee7441012e816f5a796c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_text.rs:297-315 | crates/op-editor-ui/src/widgets/property_panel_text.rs:334-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_text.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7754bab2cab9c1fe1872f8c760024ff8b856423d0d16b2060b09b4bc335e61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_compositing.rs:325-343 | crates/op-editor-ui/src/widgets/property_panel_text.rs:498-515 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_compositing.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"975d3d0b66aec06363f6518de951f954c0b4336c50ab1cf07324d1df8e7dfcb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat.rs:377-391 | crates/op-host-desktop/src/chat_session.rs:302-320 \u2014 before extracting anything, compare \u0060crates/op-engine-ffi/src/editor_chat.rs\u0060 and \u0060crates/op-host-desktop/src/chat_session.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1eaae72d39db416ad12bd961d9f2dc665351f83730bd6b5f7c20dceaf55479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/op-engine-ffi/src/editor_model_discovery.rs:225-243 | crates/op-host-desktop/src/builtin_model_refresh_host.rs:118-136 \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":"crates/op-engine-ffi/src/editor_model_discovery.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf78eb4dd0c0085c1a740d23634819c93ea80eb606516afcec9ee4ac062acde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:143-161 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:35-51 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fc5735eb77ce9ce33938cb2716a6700312666ac9cce862ce2b852e66f48db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/op-host-native/src/widget_host/press_helpers.rs:58-76 | crates/op-host-web/src/widget_host/shape_create.rs:69-87 \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":"crates/op-host-native/src/widget_host/press_helpers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebe9b5800e2a475076bbe0d32088792f6130b58c83cea70ba4903d5257c6d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:218-236 | crates/op-host-web/src/widget_host/preview_slideshow.rs:369-387 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b59abb3ec5a075455e8bb265256fc5229bc61b3736e6db0cb9d8333a1fc7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/op-mcp/src/batch_program.rs:568-586 | crates/op-mcp/src/batch_program_exec_ops.rs:204-221 \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":"crates/op-mcp/src/batch_program.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e1a2e3f6135085cbcf45a7f7ecfdd8d540804aa70c6d3a90830c6b1302079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/op-auth-bridge/src/collab_claims.rs:455-472 | crates/op-collab-transport/src/admission.rs:619-636 | crates/op-collab/src/profile_validation.rs:79-96 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab-transport/src/admission.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c99554050dd7ffda91f0d81acba9571fd29607779a7e6b4b1a713e8ba3b21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/op-auth-bridge/src/collab_claims.rs:541-558 | crates/op-collab-transport/src/admission.rs:681-698 | crates/op-collab/src/profile_validation.rs:143-160 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab-transport/src/admission.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac7f27135dd8fe0ef3bc6e6056f7006961a0ed1e695442e37422bd03045ae84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/op-ai-skills/src/resolve.rs:128-144 | crates/op-orchestrator/src/prompt_style_skills.rs:341-358 \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":"crates/op-ai-skills/src/resolve.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8470b72ad82cd5a15a6057e7272213ee9d97bade2b84eb6fd4c150254fd214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/op-collab/src/diff_index.rs:128-145 | crates/op-editor-core/src/command_refine.rs:187-204 \u2014 before extracting anything, compare \u0060crates/op-collab/src/diff_index.rs\u0060 and \u0060crates/op-editor-core/src/command_refine.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/op-collab/src/diff_index.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfee267261c5e991c0be9ee2f901ba6419bab5fa989112596093a3c3473fbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/op-collab/src/guest_pending.rs:40-57 | crates/op-collab/src/guest_pending.rs:93-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/guest_pending.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d589578ce6e63895c196d613d1565a648215770db88e52e8b84fe12e5bc8b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/op-collab-relay-server/src/connection.rs:496-513 | crates/op-collab-relay-server/src/connection_wait.rs:57-74 \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":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"555d3cd4ba7a53df86dfb195004b5fcc1434f0b0e94d0406dab9d977a7118ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_sections.rs:469-483 | crates/op-editor-ui/src/widgets/property_panel_sections.rs:606-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_sections.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5642c74b11376e09a20def1924e07c0765683d8f6e037e47ddec8cee6a80a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/op-orchestrator/src/category_grid_reflow.rs:182-199 | crates/op-orchestrator/src/repair_record.rs:475-492 \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":"crates/op-orchestrator/src/category_grid_reflow.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c290e88d46475b9acafa1fda65daa10faa67c42faac7c9157a91b1c43bfef7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/op-pen-loader/src/layout_scene.rs:97-114 | crates/op-pen-loader/src/layout_scene.rs:142-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":"crates/op-pen-loader/src/layout_scene.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1244e295f24b68a37edf172e07b413abad7274e9241198ab8d8ec028f59b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/op-smoke/src/loop_seed.rs:73-90 | crates/op-smoke/src/loop_seed.rs:164-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":"crates/op-smoke/src/loop_seed.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7791ac9eb421e76ef8600cd119de292e598e1b09d1e09069df8420f8f42a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_fill.rs:513-529 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:179-194 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:302-317 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:368-383 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_fill_body.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff5044b746d4171c054d12f4c5ae68a004b8b861626a78d12220ecd333b1ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/op-html/src/css/selectors_parser.rs:557-573 | crates/op-html/src/css/selectors_parser.rs:600-616 | crates/op-html/src/mapper_grid.rs:572-588 | crates/op-html/src/mapper_visual_syntax.rs:52-68 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7105baa0da1b8bc96632a340cc2b00278ce6a5d7b437a5a239e0e60dcc38bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/op-pen-loader/src/adapter/shapes.rs:8-24 | crates/op-pen-loader/src/adapter/shapes.rs:28-44 | crates/op-pen-loader/src/adapter/shapes.rs:51-67 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/adapter/shapes.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6353de59ec1954e38ad6dbcaaf080faab010e9477810ecf8f765d28a48c641ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-collab-host/src/runtime/network/connection.rs:83-99 | crates/op-collab-host/src/runtime/network/connection.rs:266-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bfaa4d8d8bcdea2fa346eb7b464070d7c2118ae39320df4d25755afb118d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-collab-relay-server/src/connection_reauth.rs:262-278 | crates/op-collab-relay-server/src/connection_reauth.rs:306-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection_reauth.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3378296760c4e3f47e61c9f374020198cb3c7c63d28f76918e73e5c2db0d54c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/op-collab-transport/src/driver.rs:421-435 | crates/op-collab-transport/src/driver.rs:504-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":"crates/op-collab-transport/src/driver.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca94e53108fc4f230ce03b3ce92bb413d66f1c92d567430d9f6b57e0be5275c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/op-editor-core/src/instance_child_override.rs:22-38 | crates/op-editor-core/src/ref_resolve.rs:490-505 \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":"crates/op-editor-core/src/instance_child_override.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2b5b5133501203e1c6f97910b356abf68b29efdb26cabaefcbee1bcc10c8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:37-53 | crates/op-editor-core/src/svg_path_data.rs:65-78 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/svg_import/path_data.rs\u0060 and \u0060crates/op-editor-core/src/svg_path_data.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc864ffd0361686b498de907ecd388a36be73e133359d9b2068a3580db62c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-editor-core/src/svg_import/scale.rs:51-67 | crates/op-figma/src/vector_decoder.rs:105-121 \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":"crates/op-editor-core/src/svg_import/scale.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f8205c616f2cf553ccc410901d86312bdff377525b5e7246900be2c28b70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/op-editor-ui/src/widgets/missing_fonts_panel.rs:285-301 | crates/op-editor-ui/src/widgets/property_panel_code_error.rs:268-283 \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":"crates/op-editor-ui/src/widgets/missing_fonts_panel.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcbf38c1bebdce4d4bfeb821eb861b74418c3fc4b1326d5df3998400d43f218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_input_layout.rs:311-326 | crates/op-editor-ui/src/widgets/property_panel_layout.rs:429-445 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_input_layout.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_layout.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fea97c4d3abce39d22b537f8651c6278d21a61b8fe0294f69c6a9751047300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs:120-134 | crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs:151-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c946f02c312fa225ac23b10d07cb12befa977f782fd91512e37328893a11ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat_design_tools.rs:67-83 | crates/op-host-desktop/src/chat_session.rs:537-552 \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":"crates/op-engine-ffi/src/editor_chat_design_tools.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1db5d1d3230341ed00019b60cd1107870d0ae69f53191694a3bef976bb0f6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-figma/src/converters.rs:167-183 | crates/op-figma/src/converters.rs:203-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/converters.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a97343c5b148add9e2d0188e12d7b85d5128c0eb95250abdf004f00c281920d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/op-host-desktop/src/app_state.rs:545-557 | crates/op-host-desktop/src/app_state.rs:579-595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_state.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86bf158110740efa91f8e5cfe541693093893711222fe7c8d67f176f668f19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:110-126 | crates/op-host-web/src/widget_host/slides_panel.rs:76-89 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20c5bc6582b739c015c582d1e6fb386228d255e9f4429023d6162354048b6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:262-278 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:225-238 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eadd84311857d3cd15361213ccb1c1a37fcd517dd18d55a71c9b8f20f1b6ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-host-services/src/mcp_serve/design_agent_run_tool.rs:148-164 | crates/op-smoke/src/loop_mode.rs:235-251 \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":"crates/op-host-services/src/mcp_serve/design_agent_run_tool.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ff47bb16842931c55f132ab644d4fde571511fde7791283358f5af91334e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-host-services/src/export_html_structured/fallback.rs:79-95 | crates/op-host-services/src/export_pptx/fallback.rs:62-78 \u2014 \u0060crates/op-host-services/src/export_html_structured/fallback.rs\u0060 and \u0060crates/op-host-services/src/export_pptx/fallback.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 3 separate duplicated blocks between them, totalling at least 46 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":"crates/op-host-services/src/export_html_structured/fallback.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca99e232e3b923480d8590b2d0c9e2d2ef8ff6bb47b6ab76c3e2bf7c82dfc737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-host-services/src/export_html_structured/fallback.rs:102-118 | crates/op-host-services/src/export_pptx/fallback.rs:85-101 \u2014 \u0060crates/op-host-services/src/export_html_structured/fallback.rs\u0060 and \u0060crates/op-host-services/src/export_pptx/fallback.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 3 separate duplicated blocks between them, totalling at least 46 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":"crates/op-host-services/src/export_html_structured/fallback.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80aa63f954527c062a6c2997c0f78ba8d8c274a08107a59b436068822e1e6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/op-host-web/src/preview_pump.rs:58-72 | crates/op-host-web/src/tooltip_pump.rs:42-58 \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":"crates/op-host-web/src/preview_pump.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"712cb9a630de5659c4aa036ab99ebb4bd86e278b9aa305ef9b5aa2ee185adb0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-host-web/src/web_settings.rs:531-547 | crates/op-i18n/src/locale.rs:47-63 \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":"crates/op-host-web/src/web_settings.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"989118f97721f668f8b87ae3de8d630717c48e0316c4168cb2fc8879a056fc31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-html/src/lib.rs:416-432 | crates/op-html/src/mapper_pseudo.rs:91-107 \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":"crates/op-html/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecef15853daf5465dd78951e9be37228918381815c2eee7e303b1cc085bc0e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/op-orchestrator/src/app_shell_restructure.rs:131-147 | crates/op-orchestrator/src/app_shell_restructure.rs:165-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/app_shell_restructure.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f909cb168f4a79a684d2647712344f26ec2932afd2c52b90566274a31fc334af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/op-smoke/src/main.rs:188-204 | crates/op-smoke/src/main.rs:615-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/main.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"053f2ef2d5391565c423956dd23ee3f7cf6fa91f4397f44bef0a41b124e01929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): crates/op-html/src/css/selectors_parser.rs:412-427 | crates/op-html/src/css/selectors_parser.rs:560-575 | crates/op-html/src/css/selectors_parser.rs:603-618 | crates/op-html/src/mapper_visual_syntax.rs:19-34 | crates/op-html/src/mapper_visual_syntax.rs:55-70 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/selectors_parser.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4070471d9a315de29d350434392f70188e580f484a9bc682f978a761cf24e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_fill.rs:542-556 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:214-228 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:338-353 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:403-417 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_fill_body.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb02e5eda0bf2a57aa84701d79910d8008289a286f7c3577e3af4e41aac37727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/op-host-services/src/chat_builtin_http.rs:293-308 | crates/op-host-services/src/chat_http_server.rs:146-161 | crates/op-host-services/src/chat_runtime.rs:110-125 | crates/op-host-services/src/chat_subprocess.rs:306-321 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_builtin_http.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9ad0f9ab807fd1bd2293339d2b534d17bae945e982ab8bddf4db7873b16e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/op-design-lint/src/detectors/spacing.rs:253-268 | crates/op-host-services/src/pre_validator.rs:139-154 | crates/op-orchestrator/src/validation_scroll_guard.rs:58-73 \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":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb42d0fd4d68edb51d9ce67f171baf3b7d53cb312ba1566896ffe4014bf8ffcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/op-mcp/src/parser.rs:99-114 | crates/op-mcp/src/parser.rs:359-374 | crates/op-orchestrator/src/plan.rs:168-183 \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":"crates/op-mcp/src/parser.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7964455d4c14bc475ebeaf6ccd8a6225209ebb4145e6a52c04818aebdf71e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-ai/src/agent_settings_state.rs:148-163 | crates/op-editor-core/src/agent_settings.rs:144-159 \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":"crates/op-ai/src/agent_settings_state.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55c22fcf425bd07a1badb7f1bbdc0f23e4581ac8c562d5b40594b7693b89442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-auth-bridge/src/collab_claims.rs:514-529 | crates/op-collab/src/profile_validation.rs:109-124 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab/src/profile_validation.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8c13ef22598bbd24cd3a661543ac1cf9923629e06a82d23a416a579132f4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-cli/src/html_cli.rs:237-252 | crates/op-host-desktop/src/html_import_session.rs:191-206 \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":"crates/op-cli/src/html_cli.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f407197db9fb2eb932bdb70aeb943e9b76d29967c7506f5ac66e8524f54b68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-core/src/pen.rs:283-298 | crates/op-editor-core/src/pen.rs:332-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/pen.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0f22e6b661f1a6da5b26fa69cc49c5210fea863bb22d4e578383bbf0b7ffc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/op-editor-core/src/ref_resolve.rs:226-241 | crates/op-editor-core/src/ref_resolve.rs:380-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/ref_resolve.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f870d55a59e5e32bf23fe583464cd9fd4dddc73b45763a7170a69b887822449a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-core/src/ref_resolve.rs:342-357 | crates/op-editor-core/src/ref_resolve.rs:449-464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/ref_resolve.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"062421c2fafa99a2153aabed9f75f0b1c94142a30fca2e54a2158f0acdff2282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-core/src/fills/primary.rs:65-80 | crates/op-editor-core/src/fills/primary.rs:91-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/fills/primary.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7124abb063f432015f0fe86df65cf0ecf70be3359099715ea8591ab4c0434e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-ui/src/widgets/toolbar.rs:136-151 | crates/op-editor-ui/src/widgets/toolbar.rs:154-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/toolbar.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8d87b67598add0805dc841343f34ab3ecd6b5564f62f4ba54495a7f4a0408e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs:601-616 | crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs:693-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6917560c46140bb12ef8e11c5f16c70704f40f62e938c21049e4c64a2d44ce42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:130-145 | crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:671-686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8816c1b37f1771c463e99693146e5b308dfb1be5d5dae1977fb4f0a6fc23ed43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-engine-ffi/src/lifecycle.rs:555-570 | crates/op-engine-ffi/src/lifecycle.rs:649-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/lifecycle.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3b8685750318f4ad6f3a51cb4d19aba198e44474b99e6d51f143e148a64b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/op-figma/src/instance/assignment.rs:52-67 | crates/op-figma/src/instance/assignment.rs:128-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb978b5146605547e6b257a9c9a7c2438979d40a41b961d34f1c6e3c06fee6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-host-desktop/src/persistence.rs:249-264 | crates/op-host-desktop/src/persistence.rs:273-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/persistence.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdc8a66d0c7e1181c176bdae72c525931024b16f784d22e2a138c69579c4054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:379-394 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:321-336 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c66cb4c2fa1a6d91e9af6b564ae0b0bcbc2a5a2c81f525ed7b44e0e50448bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:327-342 | crates/op-host-web/src/widget_host/preview_slideshow.rs:482-497 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae15b2d66d7f24ddb698a63428c35ba036473dfe8802bd86f6dd859c62c651b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-host-services/src/export_html_structured.rs:291-306 | crates/op-host-services/src/export_pptx.rs:444-461 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/export_html_structured.rs\u0060 and \u0060crates/op-host-services/src/export_pptx.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_html_structured.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd114dd5664109df7938ff2e7237f110c55b3b669522e01067162d814a50876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/op-host-web/src/vscode_bridge.rs:168-183 | crates/op-host-web/src/vscode_bridge/early_listener.rs:117-131 \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":"crates/op-host-web/src/vscode_bridge.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a19a0446fd85d4feb9d01fa3d302a9aaca03a6a22aa34b28d34a03b85bdca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-html/src/css/cascade_parser.rs:392-407 | crates/op-html/src/css/cascade_shared.rs:11-26 \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":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcaf3ce430fdd1ee7541de90efbeb9157fe41d211e2819ddf328fd47899b3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-html/src/css/cascade_parser.rs:396-411 | crates/op-html/src/css/cascade_shared.rs:46-61 \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":"crates/op-html/src/css/cascade_parser.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4103051d8df4f3a2dc82fa9853747eb2fa7970f7653f33379fa0b894af05328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-html/src/dom.rs:322-337 | crates/op-html/src/srcset.rs:412-427 \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":"crates/op-html/src/dom.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"81be67f526caf15da91cdc4e68ad98899554da5f462cc87ea625de23b150867c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-html/src/special_image.rs:141-156 | crates/op-html/src/special_image.rs:216-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5b3322bc460643552ba7acf7ef69d82a98a01c35b8518bc48a6330a6837d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-html/src/text_children.rs:413-428 | crates/op-html/src/text_children.rs:514-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/text_children.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"947553f2fec4e41afcc48fa047b3105d962a5f1db2ecec209db2ec7d8ab6bc02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/op-image-enrich/src/targets.rs:403-418 | crates/op-image-enrich/src/targets.rs:560-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/targets.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e44c06302780a7b1aadde3215adb484eb92ace458e95278a8218e1791392f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/op-mcp/src/script_runner.rs:648-662 | crates/op-orchestrator/src/parse.rs:74-89 \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":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4817cc84128d5bb93bedc21ad698897f65b95c9574ae51278f5c6f87c0e67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:283-298 | crates/op-orchestrator/src/touch_target_floor.rs:236-251 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3e094ca688c0311f27bd4b8a7592b2e619c472187f2074a741073bbaa9dd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/op-editor-ui/src/widgets/property_panel_fill.rs:542-556 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:110-124 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:214-228 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:339-353 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:403-417 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_fill_body.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d01e58782a058608624e0adbf5343af39ac401e077991be28de4fff4cb2592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-collab-host/src/runtime/network/connection.rs:65-79 | crates/op-collab-host/src/runtime/network/connection.rs:218-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"890c016329169c1ca134023ac0c68fc911f9a1a3c45fb8fd9dc51647b0e94e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:76-90 | crates/op-collab-smoke/src/fault_guest.rs:151-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e19c03e80273a996854f7be92496a49dc9998871d572cd59d4323d65e53796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs:453-467 | crates/op-editor-ui/src/widgets/ai_chat_transcript_steps.rs:226-240 \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":"crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eccc6a7fcc709ae440b25315dacb46fb4ad9cb5a8263417e83951cfe028eb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:55-69 | crates/op-editor-ui/src/widgets/property_panel_stroke.rs:243-256 \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":"crates/op-editor-ui/src/widgets/property_panel_fill_body.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3a8b0dbae41321b1e4be1e7afd478c27cfd9385075dc1d544ee58cc4846699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs:45-59 | crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs:200-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6104359aca9c7a411b61426c04a851e3f509faed1529dc865d2c43475ab02cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:300-314 | crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:429-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6744de66c8cdefe840371cf3a295d68c1aab27b56bb4bef702771a095682cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-engine-ffi/src/editor_model_discovery.rs:84-98 | crates/op-host-desktop/src/builtin_model_refresh_host.rs:61-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/editor_model_discovery.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de85de3bbbd7f3d874ffa1794d969d03bf37a715f22001b487f4f7a43ee0486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:236-250 | crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:72-86 \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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"354682d0e116326a7c8aff392501426a595a6ae7fb023e96ac542019ff7c91e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:62-73 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:248-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45a02bc82f451309ff7434c4ce37fb6134b505d12f570448dc8b2c68bce064f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-host-services/src/chat_spawn.rs:156-170 | crates/op-host-services/src/provider_probe.rs:298-312 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/chat_spawn.rs\u0060 and \u0060crates/op-host-services/src/provider_probe.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_spawn.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f053bfe1c562df6c617c813f9c27f48df74f04d4b84debdf16720bc12d7f9e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/connection.rs:210-224 | crates/op-host-services/src/web_canvas_server/online_run_loop.rs:596-610 \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":"crates/op-host-services/src/web_canvas_server/connection.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ac0fd2858b876c92ef11acf153627f300faa25e3121eaf478c0ea07cbef1e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:526-540 | crates/op-host-services/src/web_canvas_server/online_run_loop.rs:575-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b776d30c5689184a071d9dea976907d8583e73d9fb3aec1a03a9fec650286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-host-web/src/dom_io/browser_files.rs:81-95 | crates/op-host-web/src/dom_io/browser_files.rs:149-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/browser_files.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad31f60bec7bdd2449d33dc474e476ffc47ec3c1fdff00ff69e2fbea46d15ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/op-image-enrich/src/net/providers/catalog.rs:111-125 | crates/op-image-enrich/src/net/providers/catalog.rs:459-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/providers/catalog.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1843016b9993d9c8c0eecf2e1a88f1e46b660a10ac6b2a2771c64903d2e17253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-orchestrator/src/geometry_card_rail_fixes.rs:142-156 | crates/op-orchestrator/src/geometry_diagnostics_collect.rs:286-300 \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":"crates/op-orchestrator/src/geometry_card_rail_fixes.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"378dba59822803dea2e3b6595d5d7a59b4a995255a3903e9ad2169b8574fa712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:44-58 | crates/op-orchestrator/src/touch_target_floor.rs:23-37 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f4051ae5324ed333c49bc73a5af3a45375f3198069aecb455578dad507bebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-preview-core/src/motion.rs:163-177 | crates/op-preview-core/src/motion.rs:226-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"840c3d2ce9dfc230457d1503c5fd074fb3fab70f9931ce61e3aaa9afc97f66a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 7): crates/op-host-services/src/chat_system_prompt.rs:204-217 | crates/op-mcp/src/batch_get.rs:444-457 | crates/op-mcp/src/open_document.rs:171-184 | crates/op-mcp/src/tools.rs:44-57 | crates/op-orchestrator/src/validation_dump.rs:251-264 | crates/op-orchestrator/src/validation_fixes_apply.rs:649-661 | crates/op-orchestrator/src/validation_fixes_b3.rs:499-512 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/chat_system_prompt.rs\u0060 and \u0060crates/op-mcp/src/batch_get.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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":"crates/op-host-services/src/chat_system_prompt.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c8c5cfb262944eda4ba28c3f5a732caa8599aff12d355c5bf2478b9d15cfb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): crates/op-engine-jni/src/bindings_editor.rs:76-89 | crates/op-engine-jni/src/bindings_editor.rs:119-131 | crates/op-engine-jni/src/bindings_editor.rs:159-172 | crates/op-engine-jni/src/bindings_editor.rs:204-217 | crates/op-engine-jni/src/bindings_editor.rs:370-382 | crates/op-engine-jni/src/bindings_editor.rs:427-439 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/bindings_editor.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e777951684499aa9fa031921cc36831ef4ac5307413ec506e2535c055d659fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/op-editor-core/src/host_support_allocator.rs:187-200 | crates/op-editor-core/src/host_support_allocator.rs:232-245 | crates/op-editor-core/src/host_support_allocator.rs:289-302 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_support_allocator.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5610a6c0ce4c22d2458f6bcc93439f39ec27c938164d95b1be40a46d75f0f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/op-host-services/src/doc_io.rs:283-296 | crates/op-host-services/src/web_canvas_server/doc_routes.rs:99-112 | crates/op-host-web/src/file_actions.rs:384-397 \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":"crates/op-host-services/src/doc_io.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c9b2e2ebef2de4b73c2f17f8a4bcacc1698d5e913e25c161279b1374bf26f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/op-mcp/src/parser.rs:240-253 | crates/op-mcp/src/parser.rs:275-288 | crates/op-mcp/src/parser.rs:458-471 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d794571cee1bb2e4b268ebb3fc7b0e882b8cda19ff14337fd6efd15bd8338a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-chat-agent/src/design_agent_tools.rs:79-92 | crates/op-chat-agent/src/design_agent_tools.rs:243-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"55199a39be3eafb52b6f49251eca82ef038861b8e1f9367d4415014eae65e2e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-cli/src/command_mappers.rs:233-246 | crates/op-cli/src/command_mappers.rs:290-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/command_mappers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"84acc415f8d308eb2c0e4bdea81f5e4e79b52d27eb86be6e6cbea9d39725e8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:65-78 | crates/op-editor-core/src/svg_path_data.rs:86-99 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/svg_import/path_data.rs\u0060 and \u0060crates/op-editor-core/src/svg_path_data.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"caee609c7a3068088a61d9d7be2be6e7491a905061c94251327055963849d5e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-core/src/command_node/builders.rs:105-118 | crates/op-figma/src/lib.rs:426-440 \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":"crates/op-editor-core/src/command_node/builders.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f733c69b967a67346c56a38d5133dd8aadb758ba7d044c0fe41576ffc09aeff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-core/src/command_node/builders.rs:164-177 | crates/op-figma/src/lib.rs:515-529 \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":"crates/op-editor-core/src/command_node/builders.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83b2eda38ae9b035bc5a526cc35a42ccd945f7ca92c0e6ca1ab8453e4310ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs:310-323 | crates/op-editor-ui/src/widgets/agent_settings_builtin_parts.rs:205-218 \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":"crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47e0352bc770cfa3de60cc81865362642bd48a10405bc38b434c19448a3c345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-ui/src/widgets/scene_template_card_actions.rs:115-128 | crates/op-editor-ui/src/widgets/scene_template_touch_density.rs:274-287 \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":"crates/op-editor-ui/src/widgets/scene_template_card_actions.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e3f49318fbe40cfe3c72e283accafc2832c0f9f469205ae28b00c6e3a1b50d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs:432-442 | crates/op-editor-ui/src/widgets/scene_template_card_paint.rs:172-185 \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":"crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cf5d16f015b8c681e70b62267d63d33c6fc6c27928023fea24658ea9737f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-ui/src/widgets/file_menu_paint.rs:273-286 | crates/op-editor-ui/src/widgets/file_menu_paint.rs:329-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/file_menu_paint.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f800f8589f3e163447b5ba12007f0f20213e9e0c72802feca2b5fcbc6a1266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs:389-402 | crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs:404-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"100d60325e3bbde2ec80cb80c9eb5819627370282016ddefe1b5941bae8b662d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs:313-323 | crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs:430-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb83248e26b65d79b83e12b0f8df78faa8e8c3b053f001fc8a9b9975ed16a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_widget.rs:201-214 | crates/op-editor-ui/src/widgets/property_panel_widget.rs:241-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_widget.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f8b9cfc6628ed20445fdbf128ae1ba7afc1a8a7e4ede376d58227512552e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-engine-ffi/src/lifecycle.rs:607-620 | crates/op-engine-ffi/src/lifecycle.rs:691-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/lifecycle.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"51150fd2a17c65f2f247ac7e4f417a2faac4c243879f76b4f95fd946145496fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-figma/src/node_mapper.rs:121-134 | crates/op-figma/src/node_mapper.rs:189-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/node_mapper.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cfb07eeebc648b0436a10194c0abb58af67b4871a06d5a90cb016c98f58f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-desktop/src/image_search_session.rs:42-55 | crates/op-host-services/src/mcp_serve/enrich_images_tool.rs:141-154 \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":"crates/op-host-desktop/src/image_search_session.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd22622eff643f820035857c3f253690672f9f99336bdc4f9c01f61dcfece4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/op-host-native/src/backend/skia.rs:536-549 | crates/op-host-native/src/backend/skia.rs:565-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"355079cdee81f450146dabeb6c6c2d250909b183898080cfce4d8aad77286526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:79-92 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:165-178 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"797034043aa6f3d9338e64e2bfaa248d5c4013312cdd80d890f0d185704c7d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:99-112 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:334-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2ab3df05ed6f3c2c1f73e3281b25b9b875a3ca9be45fc68f46be797bc0cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-services/src/web_credentials.rs:285-298 | crates/op-host-services/src/web_credentials.rs:415-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_credentials.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"925711966486b25d7dc313626df2edbe588208a87fdbc74bb0dedd5dc7055efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-services/src/mcp_serve/sniff.rs:135-148 | crates/op-mcp/src/parser.rs:462-475 \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":"crates/op-host-services/src/mcp_serve/sniff.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf23aff39f6135f3cf3dac5dd2852395495358bedc3e043aa8cc9fa3f291c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-web/src/dom_io/html_directory_session.rs:348-361 | crates/op-host-web/src/dom_io/html_zip_session.rs:380-393 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a1919a7f2c711d84fd61e88424e6d5a9b470ed23c6a3e12005b5fb70e8cc08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-web/src/live_sync.rs:193-206 | crates/op-host-web/src/web_image_panel.rs:387-400 \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":"crates/op-host-web/src/live_sync.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2081bbb41d0346ef49039c7b69c4d6eae1f7a938d8b17fd11c1ea10744d93f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-web/src/widget_host/variables_panel_rows.rs:184-197 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:288-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/variables_panel_rows.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1986a98840e0b9df7cd99daa3266bc9c8c48f024224214dc4061100e95ca9abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:329-341 | crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:398-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_edit_ops.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc330cab18638858300a61fb85fe73ce4dec923ef10e2871e149a9235c34639e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-html/src/lib.rs:419-432 | crates/op-html/src/mapper_grid.rs:126-139 \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":"crates/op-html/src/lib.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b78f4c3727af683b05c5838039fff582269183c0f6082dd5d465290031f5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-html/src/project_zip.rs:213-226 | crates/op-html/src/project_zip_range.rs:239-252 \u2014 before extracting anything, compare \u0060crates/op-html/src/project_zip.rs\u0060 and \u0060crates/op-html/src/project_zip_range.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7518757b4205a7a6273b6ff17a4bdbcfdc17d964caa68aff8bea20c5a57e3146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/op-html/src/resources.rs:513-524 | crates/op-html/src/resources.rs:560-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f59732db97eeb561491278baed3a0a153914c5c227d542153d674eecd3be50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/op-html/src/resources_css_urls.rs:16-29 | crates/op-html/src/resources_css_urls.rs:192-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources_css_urls.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc364c40d1eabb66cd62ddc73e2f53f273833fd8e611d2efd62a03980ffb571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-mcp/src/node_attr_tools.rs:209-222 | crates/op-mcp/src/node_attr_tools.rs:345-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/node_attr_tools.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a212c780f4b96c56791693fe8810bfdb63b278b8027351b265f80c86fdde2dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-mcp/src/selected_ops_tools.rs:21-34 | crates/op-mcp/src/selected_ops_tools.rs:277-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/selected_ops_tools.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec1bd134e7697959b3f58c8e34f6a22e00459a5a8a12b44a9114fd48fb339ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/op-orchestrator/src/cleanup_section_margins.rs:134-147 | crates/op-orchestrator/src/cleanup_slide_padding.rs:130-142 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/cleanup_section_margins.rs\u0060 and \u0060crates/op-orchestrator/src/cleanup_slide_padding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_section_margins.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f924075150e034993faf7c915a87647676e1bd7be6e35efe5c96ac4f1ff49c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-orchestrator/src/plan.rs:436-449 | crates/op-orchestrator/src/plan_fallback_card.rs:122-135 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/plan.rs\u0060 and \u0060crates/op-orchestrator/src/plan_fallback_card.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabad7e27e562bec70215e911acaf1cfb69e0a55460d1767ca9098cf404fca6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-orchestrator/src/finalize_enforce_status_bar.rs:90-103 | crates/op-orchestrator/src/unify_shared_status_bar.rs:192-205 \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":"crates/op-orchestrator/src/finalize_enforce_status_bar.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74acdcc965de3ecb7d84e7eb7f37831eef9ecaa7ed0d5ef4025197bef6e7506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-preview-core/src/present.rs:280-293 | crates/op-preview-core/src/session_paint.rs:114-127 \u2014 before extracting anything, compare \u0060crates/op-preview-core/src/present.rs\u0060 and \u0060crates/op-preview-core/src/session_paint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3565eae5042d0cfc4f951a659f8820b4e9851f10dd19c65037a9413c40c37f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/op-host-desktop/src/git_jobs.rs:95-107 | crates/op-host-desktop/src/git_jobs.rs:289-301 | crates/op-host-desktop/src/git_jobs.rs:345-357 | crates/op-host-desktop/src/iconify_host.rs:67-79 | crates/op-host-services/src/provider_probe_host.rs:69-81 \u2014 there are 5 copies across 3 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/git_jobs.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e3d731fea1ad592bbd4df2272de906a0f4904a5dc188ee7f8e8f171f19382d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:243-255 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:195-204 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9384766033a4996adf921ee887db4dd72b2bf939df9ff102ba4444cb854b5d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-collab-relay-control-plane/src/http_client.rs:203-215 | crates/op-collab-relay-locator-server/src/http.rs:571-583 \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":"crates/op-collab-relay-control-plane/src/http_client.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cfae25dc5d237735b0243ca31d520c0a4bc88d9b78e9872349e959e5069ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/op-design-lint/src/detectors/siblings.rs:79-91 | crates/op-design-lint/src/detectors/siblings.rs:419-429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/siblings.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b9e401698548bd4833c33fc563775c5e9c7a6c8461cea63efc7a5b25e05bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/op-editor-core/src/instance_override.rs:119-127 | crates/op-editor-core/src/ref_resolve.rs:241-253 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/instance_override.rs\u0060 and \u0060crates/op-editor-core/src/ref_resolve.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c42c52b555d20e05e5726cc277d73d323713481b6143fb019deb71a57d40630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-core/src/text_edit.rs:81-93 | crates/op-editor-core/src/text_edit.rs:143-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_edit.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4168ee3966e38ea738643f95ee8cc81a929e158211ba515a69dacf6cce792928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/op-editor-host-core/src/codegen_runtime_state.rs:44-56 | crates/op-host-web/src/codegen_web.rs:151-159 \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":"crates/op-editor-host-core/src/codegen_runtime_state.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2fe7063ceffea9e5aef9df7b2300c0ef109c217b2bd88569eb75138158f0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-host-core/src/settings_io.rs:332-344 | crates/op-host-web/src/web_settings.rs:415-427 \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":"crates/op-editor-host-core/src/settings_io.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5d2f6cd9956541e439480ed42daa0877b26f2349e421abed335ee2b3d3304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/account_menu.rs:223-235 | crates/op-editor-ui/src/widgets/file_menu_paint.rs:257-269 \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":"crates/op-editor-ui/src/widgets/account_menu.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0f9aa05ec2c34e913afb971abd56374bde16f9be63c01fee7b8fd166f37611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/ai_chat_panel_header.rs:452-464 | crates/op-editor-ui/src/widgets/ai_chat_panel_header.rs:467-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_header.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"de964fbc389d4c7ec72cdc2fdde7126649f35d931497aaa4225f5b4f16e09ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_text.rs:196-208 | crates/op-editor-ui/src/widgets/canvas_viewport_text.rs:218-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_text.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cfce788a5b3d7fa26dbfe185f823766987a404b0c43c2bc5a108e3b0b8bafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/layer_panel_walkers.rs:160-172 | crates/op-editor-ui/src/widgets/layer_panel_walkers.rs:189-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel_walkers.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"64940eee92e05e171f46c9210509d5a62a895c5ce8feb2ac9a57726459ff5a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_input_layout.rs:439-451 | crates/op-editor-ui/src/widgets/property_panel_layout.rs:447-459 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_input_layout.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_layout.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7271454dd20caab4e956d4418a017ac835b001c25f2d2d94a9237f1142c60768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint.rs:512-524 | crates/op-editor-ui/src/widgets/home_surface_paint_cards.rs:217-228 \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":"crates/op-editor-ui/src/widgets/home_surface_paint.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"8417068b21d9d93ad2b95f1138d4ad08128d31f7ecaec5cb0207c7fbffe4b897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs:18-30 | crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs:148-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ee1d353fa6a72c036194496e2d4e3a02918d53f63bafbe9bdaa0b975ebf4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat.rs:417-429 | crates/op-host-desktop/src/chat_session.rs:354-369 \u2014 before extracting anything, compare \u0060crates/op-engine-ffi/src/editor_chat.rs\u0060 and \u0060crates/op-host-desktop/src/chat_session.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffee231e6a51e24a8ec17250332accc30ff1fded475307194ad15ba026749d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-figma/src/image_resolver.rs:514-526 | crates/op-figma/src/image_resolver.rs:546-558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/image_resolver.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc54ddbaf4247b0ec04b7c70ad6748dee5b2a2fa93f003d21f44dc2a9f20541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/op-host-desktop/src/image_panel_host.rs:187-199 | crates/op-host-web/src/web_image_panel.rs:345-356 \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":"crates/op-host-desktop/src/image_panel_host.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1e5608530894e2cf92f84bce400620197bfa5f4b6f3ab132c6350d1fc5da70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-desktop/src/mcp_config_io.rs:134-146 | crates/op-host-desktop/src/mcp_integrations_dsh.rs:110-122 \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":"crates/op-host-desktop/src/mcp_config_io.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"859582f3ed12023c2ffa354c57428aea41061828e4e2d3c3a47d73311e80ead5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:334-346 | crates/op-host-web/src/widget_host/slides_panel.rs:225-237 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2487f5514ebaa2002bedad0e45d5e3a891ce85ec59381c28cd058ac27c87b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:104-116 | crates/op-host-web/src/widget_host/preview_slideshow.rs:256-268 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"576c418ebef4d4d9de98c4adc716d8c292a8a70df6af89e84a10fd65a24de76d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:226-238 | crates/op-host-services/src/web_canvas_server/run_loop.rs:160-172 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/web_canvas_server/online_run_loop.rs\u0060 and \u0060crates/op-host-services/src/web_canvas_server/run_loop.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"691e289dd1107e94ce4874eb1e4ffd8b389db3b596feee4d466db16e38c5264f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-services/src/cli_model_discovery.rs:217-229 | crates/op-host-services/src/cli_model_discovery_antigravity.rs:57-69 \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":"crates/op-host-services/src/cli_model_discovery.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"273df3f64c2db0b2806b08255519244624043d93cdd1d4d842218b588199773a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:602-614 | crates/op-host-services/src/web_canvas_server/online_run_loop.rs:618-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"08372dbd49c668e7b943e251e8798bb066478b717498ca55afb09e20323b176c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/op-orchestrator/src/cleanup_section_margins.rs:226-234 | crates/op-orchestrator/src/cleanup_slide_padding.rs:296-308 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/cleanup_section_margins.rs\u0060 and \u0060crates/op-orchestrator/src/cleanup_slide_padding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_section_margins.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc9d64dbb575cb9cbf23cb800a2df972ad1dccaafc3ffadd656ecb3e2562a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-orchestrator/src/cleanup_slide_padding.rs:254-266 | crates/op-orchestrator/src/cleanup_slide_padding.rs:357-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db37ee693be3a35a0e4e4024bacbf28b0474e34207f449c96f47dfe7efc5465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-orchestrator/src/finalize_enforce_status_bar.rs:168-180 | crates/op-orchestrator/src/finalize_enforce_status_bar.rs:232-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/finalize_enforce_status_bar.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd00fcf0c5f6628bae95effcde18896f99effeda6e0ef79d53b5e6cbe70350f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-preview-core/src/motion.rs:388-400 | crates/op-preview-core/src/motion.rs:427-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"622f100c42ae36c5179066983c76970277e3343b3141101c8700e679b9a09fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/op-preview-core/src/present.rs:300-312 | crates/op-preview-core/src/session_paint.rs:137-148 \u2014 before extracting anything, compare \u0060crates/op-preview-core/src/present.rs\u0060 and \u0060crates/op-preview-core/src/session_paint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e816a7591707e7d1cd6098b6e823a341fe19347087e9e65ad599fa5c895760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/op-mcp/src/batch_get.rs:240-251 | crates/op-mcp/src/read_nodes.rs:103-114 | crates/op-mcp/src/style_ops_tools.rs:158-169 | crates/op-mcp/src/style_ops_tools.rs:174-185 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab591df00bddc11fa531a0832012a00476d5105317b0587e1fc9c768ab488319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/op-mcp/src/import_common.rs:62-73 | crates/op-mcp/src/write_tools.rs:106-117 | crates/op-mcp/src/write_tools.rs:175-186 | crates/op-mcp/src/write_tools_import_svg.rs:58-69 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/import_common.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd59316844daf602712e02ad124f6d4e8fa50a8f7a7e0e3690bf25976499b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/op-editor-ui/src/widgets/property_panel_fill.rs:559-570 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:231-242 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:420-431 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_fill_body.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fb0b8ed4b7a72bc1ab6d6a21ab195198b6a721cc54a793679dfec1d441d715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/op-host-services/src/export_html.rs:60-71 | crates/op-host-services/src/export_hyperframes.rs:204-215 | crates/op-host-services/src/export_pptx.rs:101-112 \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":"crates/op-host-services/src/export_html.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dfe6dd37d4d38d2c2731a849fc25142a257d8b4535e67f28472721d6a7adf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/op-html/src/mapper_box.rs:146-157 | crates/op-html/src/mapper_margin.rs:357-367 | crates/op-html/src/mapper_margin.rs:666-677 \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":"crates/op-html/src/mapper_box.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b62d999c25ed95a69dcbb5f084aebd2ea6624517f4c65b4d1ec23380ae5204b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:306-317 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:247-258 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"568b62d95f1c6563edcb76cafbedb2608b588ae96d06c9bce6933eff159a6e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-collab/src/codec.rs:244-255 | crates/op-collab/src/codec.rs:363-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/codec.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f176278dc4b088b8f15c88304c50ee4dfb851aa1c6cdceb1c306d68b7c3bd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-collab/src/guest_pending.rs:328-339 | crates/op-collab/src/reapply.rs:60-71 \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":"crates/op-collab/src/guest_pending.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c90e19c89bce2504bc498b4670308a76e9dba56e3ab0a3c295524c29df9482c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-collab-relay-locator-server/src/http.rs:447-458 | crates/op-collab-relay-locator-server/src/http.rs:517-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-server/src/http.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"025fc7f566bedc1662ccc055cf471bc06bad3ea60af6c619943b6c30d43ab5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:62-73 | crates/op-collab-smoke/src/fault_guest.rs:137-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb1ef89d0f53933b0028490616790dd2d8d31f27cb8bcb9d5223fad027d7212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-core/src/command_style_replace.rs:275-286 | crates/op-editor-core/src/command_style_replace.rs:297-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f4cf8e847a9a89637eb7f5e9a4cea537bcacce22fc814ace151092fada883d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:102-111 | crates/op-editor-core/src/svg_import/path_data.rs:172-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"106bb7efe0a83dc717be7e3107a036d341a71b695e2af449619773ed0ff2b412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:130-141 | crates/op-editor-core/src/svg_import/path_data.rs:154-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc643adcab6f15ac4f79d63664f5435b64c7eed0702ef86ef2b9749747bace4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-core/src/host_preset_name_draft.rs:47-58 | crates/op-editor-core/src/host_preset_name_draft.rs:72-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_preset_name_draft.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a244ce31735faa17b7e89c4209334ff5282c01757688407557302769db099b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-core/src/svg_import/nodes.rs:131-142 | crates/op-editor-core/src/svg_import/nodes.rs:146-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/nodes.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8953c3cd794db1a745bc0423cf7bfb1dcdef0b424568f76d363c0fa2acec7e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/collab_avatar_runtime.rs:476-487 | crates/op-editor-ui/src/collab_avatar_runtime.rs:497-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/collab_avatar_runtime.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a602157957408c10e749e65a406c31df7579463e8023dede9897b0646480ea78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_account.rs:98-109 | crates/op-editor-ui/src/widgets/agent_settings_account.rs:253-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_account.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"79955b4096f534e1b2c64f420f29e84d451b5f9cb9977341ac0a304e8eba03c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:188-199 | crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:278-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f01a2985e7815a682d168343c383de8bd261dde9b9e5181d6f5c0590c3f489a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_panel/layout.rs:132-143 | crates/op-editor-ui/src/widgets/agent_settings_panel/layout.rs:169-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_panel/layout.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45cb39f1af8b46e0d77f01986dcede9c21c86a0324dcf1054011c82bf09a376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/ai_chat_transcript_steps.rs:139-150 | crates/op-editor-ui/src/widgets/ai_chat_transcript_steps.rs:177-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_steps.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"527249a86ebb450d79207886ef6ddcb398f858585a9e504d7cc964a452253ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_layout_transition.rs:143-154 | crates/op-preview-core/src/binding_overlay_apply.rs:191-202 \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":"crates/op-editor-ui/src/widgets/canvas_layout_transition.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4f16e64fdc7e14a97994cfae5b3a0dbe0224bcd5219308097e26edf3bfb5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/collab_panel.rs:498-509 | crates/op-editor-ui/src/widgets/collab_panel.rs:553-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbee2d2e1f9b63e57401762c4d86839eaa56d6e7f5a7cb12fdc7c95a47e89e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/op-editor-ui/src/widgets/component_browser_panel.rs:546-557 | crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs:124-134 \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":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fd1d21df7577f905b27c15fa3b6381b5787f1de2381aa584303eecb6f0bb55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/figma_import.rs:344-355 | crates/op-editor-ui/src/widgets/figma_import_progress.rs:111-122 \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":"crates/op-editor-ui/src/widgets/figma_import.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2223c258a98255f92fb50d9502276f5a521dcd9c83b306d3280032e22b39bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/op-editor-ui/src/widgets/figma_import.rs:361-372 | crates/op-editor-ui/src/widgets/figma_import_progress.rs:155-164 \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":"crates/op-editor-ui/src/widgets/figma_import.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb4b28c9c9f7e08cbfb24c462ba91799e3b89320115cedf7b8492e8e4c49989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_text.rs:632-643 | crates/op-editor-ui/src/widgets/property_panel_text.rs:729-740 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_text.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb1c5b3dc1c9c58d2b627428661a62edb67ce07aaaf897c26229ee2df3c2fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:402-413 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:534-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad62146acdfc4bff59383cc697cbf6a0501cd58737a5066177f323dc2e83c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/op-engine-jni/src/callbacks.rs:114-125 | crates/op-engine-jni/src/callbacks.rs:138-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/callbacks.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50806490a893f59a66b86e097aba8091342148fa7704403448845d22570c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-figma/src/instance/fingerprint.rs:382-393 | crates/op-figma/src/instance/fingerprint.rs:435-446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/fingerprint.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"509b430daeb1626bd1084243d387b4d5dae5ab0b8b264a90a81601b54cc86e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-figma/src/tree.rs:54-65 | crates/op-figma/src/tree.rs:75-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/tree.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"062a32c79815962c434f8c6064e94256d14bbff5781860e0280262ad45141d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-figma/src/boolean_fallback.rs:75-86 | crates/op-figma/src/boolean_fallback.rs:140-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/boolean_fallback.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbde2e2df7534a265b5f686c686d26356cf8b22f8b57660e9ace6ea6b6edf46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-desktop/src/chat_acp.rs:396-414 | crates/op-host-services/src/chat_http_server.rs:157-168 \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":"crates/op-host-desktop/src/chat_acp.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"42713154e4fd596c46559033d4bd57b1766942ab7941e2ec59c5105ef3df818b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-desktop/src/chat_session.rs:295-306 | crates/op-host-desktop/src/chat_session.rs:398-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d59851570a2b6a1113c572efecb2e634c8cb2265dece942dfcbd38a4a89eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/op-host-native/src/backend/skia/path.rs:439-449 | crates/op-host-native/src/backend/skia/path.rs:532-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia/path.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c9415408e1384be5dd8cb85cfdad35e67e96f3f2d4f35e0dcdc211f8e2f389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:315-326 | crates/op-host-web/src/widget_host/slides_panel.rs:178-189 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1612e3c8aecf9073bc533d4920f759038afee978e3f1b2e2058fcb298af09447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:70-81 | crates/op-host-web/src/widget_host/variables_preset_press.rs:46-57 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"09babc075d43446bb7eb6d27f88c45a42a9efebb2ad3d9af2e4a71982b577fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:218-229 | crates/op-host-web/src/widget_host/variables_preset_press.rs:154-165 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4380253a4dc12046fbe6cb700c4a06111d2aa7a086016d97ccafdc0c71ddd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:224-235 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:100-109 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7653d662d060d2bc9df1559a69084687edee4eddd6e793f8bf5507bc7c5bf12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:248-259 | crates/op-host-web/src/widget_host/preview_slideshow.rs:399-410 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98eb0240a2c44d836d90b9af167d3c370a43c14b37966927e89b5f08d19ec37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:268-279 | crates/op-host-web/src/widget_host/preview_slideshow.rs:419-430 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd59b9146475dd6ae2ff861574afa7d4cfb3f8b8ccbf3a9230cdf05b88109109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-services/src/import_html_url.rs:66-77 | crates/op-mcp/src/import_common.rs:140-151 \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":"crates/op-host-services/src/import_html_url.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8283e1897ca7e9c1b9ddbf4c20675b476c1661d3f65d75b664be3cd56365f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-services/src/export_html_structured/fallback.rs:120-131 | crates/op-host-services/src/export_pptx/fallback.rs:103-114 \u2014 \u0060crates/op-host-services/src/export_html_structured/fallback.rs\u0060 and \u0060crates/op-host-services/src/export_pptx/fallback.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 3 separate duplicated blocks between them, totalling at least 46 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":"crates/op-host-services/src/export_html_structured/fallback.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c7455f15319cc6e7f9bdc4a00e84107400f83bacdac3d2963665fa9a9be334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-services/src/mcp_serve/sniff.rs:69-80 | crates/op-host-services/src/mcp_serve/sniff.rs:99-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/sniff.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16a944d43c9a70fd8db3ee284e46afd44d926ae6bff202a63e68533ccd7a3cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/op-host-web/src/live_sync.rs:103-114 | crates/op-host-web/src/live_sync.rs:164-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20d6f97dbeb50c0de825c77fc369473c184c6070b6235cabb86f0b7fc781137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-html/src/project_zip.rs:267-278 | crates/op-html/src/project_zip_range.rs:307-318 \u2014 before extracting anything, compare \u0060crates/op-html/src/project_zip.rs\u0060 and \u0060crates/op-html/src/project_zip_range.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b333194d4cce2aa49cef7f256e6fe07470b8e3dfc4bd01bbb395df3ac9d637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-html/src/special_image.rs:77-88 | crates/op-html/src/special_image.rs:170-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/special_image.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a49f4dea02de1ce81c78fefd0adc4ddbe56fb21ea21261065d4dfc0265e2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-mcp/src/conversion_tools.rs:62-73 | crates/op-mcp/src/conversion_tools.rs:99-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/conversion_tools.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f50d73a087cdd2b1cb995523fcaccaaa2778bd5bdba9375638e3082fcccdcb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-mcp/src/insert_node_args.rs:60-71 | crates/op-mcp/src/write_tools.rs:338-349 \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":"crates/op-mcp/src/insert_node_args.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c721cb49a3cafed17fc3bdbe5e218d487d73451fb46334216d2ebc1169236d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/op-mcp/src/parser.rs:174-184 | crates/op-mcp/src/parser.rs:395-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1025278725be0ab26b64e3798e6cc4a21429cbf63b08eccf109dc1168e9ef12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-mcp/src/parser.rs:409-420 | crates/op-mcp/src/parser.rs:433-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cc79a86aa728ae1142f200fbe99699e5730a17f895f50fe4811e1b207d64ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-orchestrator/src/finalize_enforce_status_bar.rs:154-165 | crates/op-orchestrator/src/finalize_enforce_status_bar.rs:212-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/finalize_enforce_status_bar.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b6c12dc6997b94b976659261d34932dcc9ad0b10894cd8d8b56ba4c28ab0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/op-pen-loader/src/style_payload.rs:537-547 | crates/op-preview-core/src/session_paint.rs:610-621 \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":"crates/op-pen-loader/src/style_payload.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8ccdeef78e696ea583094f016d0dfcde986c1d41111a537b25073c19f6d009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_fill.rs:530-540 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:202-212 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:325-336 | crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:391-401 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_fill_body.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dac1a6521221f585999bed5c92dc482e8eb0bd67ee0b6a53d7d33b5c364671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-collab-smoke/src/fault_guest.rs:58-68 | crates/op-collab-smoke/src/fault_guest.rs:95-105 | crates/op-collab-smoke/src/fault_guest.rs:133-143 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b3013fe3078724612306f13ab4636ff1d50cf0717f95c94328f1ae4b2e78fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-collab-smoke/src/fault_owner.rs:298-308 | crates/op-collab-smoke/src/fault_owner.rs:414-424 | crates/op-collab-smoke/src/fault_owner.rs:464-474 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13ba7969f8136bbe62ab472935cf325e6935b80517cbd706ba3df0be9a2ffa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 3): crates/op-editor-core/src/instance_override.rs:130-136 | crates/op-editor-core/src/ref_resolve.rs:257-267 | crates/op-editor-core/src/ref_resolve.rs:405-410 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/instance_override.rs\u0060 and \u0060crates/op-editor-core/src/ref_resolve.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e9efecbf39518b4120540763df87bd8eb0920207cf51fc72d4511b559385c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-editor-ui/src/widgets/home_surface_connect.rs:89-99 | crates/op-editor-ui/src/widgets/home_surface_paint.rs:511-521 | crates/op-editor-ui/src/widgets/home_surface_paint_cards.rs:216-226 \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":"crates/op-editor-ui/src/widgets/home_surface_connect.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f37436e9d4daab24972cb1bbeaebafef9ab92cd9699c85e25ade79bbe20d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-host-desktop/src/design_md_host.rs:105-115 | crates/op-host-services/src/design_md_llm.rs:31-41 | crates/op-host-web/src/web_design_md.rs:288-298 \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":"crates/op-host-desktop/src/design_md_host.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"70784c65d367f7468dec6aa593abee3cd78e3cf0b1063c56d4e5328e8b82d736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:34-44 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:103-113 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:338-348 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbd90dbc4b86598e4c2fc47301681a514b3be31db4b6f8642ddaf7ae5f97753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/op-host-services/src/chat_spawn.rs:179-186 | crates/op-host-services/src/cli_probe_support.rs:112-122 | crates/op-host-services/src/provider_probe.rs:330-337 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/chat_spawn.rs\u0060 and \u0060crates/op-host-services/src/provider_probe.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_spawn.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0826f42221d5776d7b4c6ae7961c5cf0a5e225db1903030f8a6925dedb5ce869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/op-host-web/src/agent_indicator_sync.rs:71-81 | crates/op-host-web/src/preview_pump.rs:66-73 | crates/op-host-web/src/tooltip_pump.rs:50-59 \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":"crates/op-host-web/src/agent_indicator_sync.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7977622fdf98d0dd7c2ade7391235956c0918406cc04622b536f49da73a3f819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-host-web/src/live_sync.rs:133-143 | crates/op-host-web/src/live_sync.rs:194-204 | crates/op-host-web/src/web_image_panel.rs:388-398 \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":"crates/op-host-web/src/live_sync.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0041d683a910b94c9c6733a06a64d00b3aa7af461c284038a919348e478b8e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/op-pen-loader/src/adapter/entry.rs:119-128 | crates/op-pen-loader/src/adapter/pages.rs:31-41 | crates/op-pen-loader/src/adapter/pages.rs:49-56 \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":"crates/op-pen-loader/src/adapter/entry.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6381aa3c18c4064cb045c31e9ca3d96d31579252908e200ed536a1e6f358370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-preview-core/src/present.rs:281-291 | crates/op-preview-core/src/session_paint.rs:55-65 | crates/op-preview-core/src/session_paint.rs:115-125 \u2014 before extracting anything, compare \u0060crates/op-preview-core/src/present.rs\u0060 and \u0060crates/op-preview-core/src/session_paint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cda0500ca20d6dac85995f9fa217dcf9d58033ff5e654d4b64b04f77563a9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-ai-skills/src/style_guide/card.rs:89-99 | crates/op-ai-skills/src/style_guide/summary.rs:65-75 \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":"crates/op-ai-skills/src/style_guide/card.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb0f172b5bdccfeb067c8f648a53e81c4c4b693d0f581fc18e430e056e7d14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-ai-skills/src/style_guide/design_md_import.rs:349-359 | crates/op-ai-skills/src/style_guide/token_table.rs:204-214 \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":"crates/op-ai-skills/src/style_guide/design_md_import.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7bfd4b8c32d71e1679a5cb024f8972b22bb1d8426d1769ea10b13cd8ee74c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:191-197 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:143-153 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6844b5b1c47aacf49464ac33cd97e3ef35fcd522999a029ccf7e8e04b64f3b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-collab-relay-control-plane/src/pairing_wire.rs:108-118 | crates/op-collab-relay-control-plane/src/pairing_wire.rs:187-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-control-plane/src/pairing_wire.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5115c2d3576ce5db26326a2a8a11358b696caf172a365348535547ffe81b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-collab-smoke/src/fault_owner.rs:53-63 | crates/op-collab-smoke/src/fault_owner.rs:224-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6c5b1c9eaa7313b1b849b2975c81c43958415ef34b0acc303bc2b0a45bef03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-collab-transport/src/driver.rs:484-494 | crates/op-collab-transport/src/driver.rs:556-566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/driver.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6fa0b8d311a1897febf7713138614a6591f1c7b5d9b966f4ec446e1c5ef834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-core/src/fills/image.rs:143-153 | crates/op-editor-core/src/image_node_props.rs:48-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":"crates/op-editor-core/src/fills/image.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfef0d9a8d910fc4853a1bce82dbb91db86b46483cf26468a7289fee4490f33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-core/src/fills/image.rs:158-168 | crates/op-editor-core/src/image_node_props.rs:62-72 \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":"crates/op-editor-core/src/fills/image.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b6922414fcdf6f3826c356354fb5c6b2dc93e36ba857ce0f5a8305006150b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-core/src/page_mutators.rs:205-215 | crates/op-editor-core/src/page_mutators.rs:379-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/page_mutators.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b9073059ef4b8b36c256c541d3d0d2369f81ef71518b41149eaa054a246ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_account.rs:182-192 | crates/op-editor-ui/src/widgets/top_bar_paint.rs:651-661 \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":"crates/op-editor-ui/src/widgets/agent_settings_account.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a7cb05c842e7e40caf603927b28762fc4730db5cfcc052ae129f14b573a04e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs:432-442 | crates/op-editor-ui/src/widgets/agent_settings_builtin_parts.rs:459-469 \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":"crates/op-editor-ui/src/widgets/agent_settings_builtin_model_menu.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52fcc70f3319761eccbe1a6e446eba01c8d059a3698aa020410f7f535a6ce36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_rows.rs:378-388 | crates/op-editor-ui/src/widgets/agent_settings_rows.rs:431-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_rows.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3d032982f23bce765ee393ff1905b2fcdad85ebd5360c42c6d03eac2eed9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/op-editor-ui/src/widgets/layer_panel.rs:490-500 | crates/op-editor-ui/src/widgets/layer_panel.rs:678-687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d07cb973a6ec4b71dbd57ca3206591e89bfa32e06c7446c1d60a03bec0330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:236-246 | crates/op-editor-ui/src/widgets/property_panel_interactions.rs:311-319 \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":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c06aafba5ae6b380baa07d8b7b5b6d1ec75466257cf8240a5b0b110149625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_image_node.rs:152-161 | crates/op-editor-ui/src/widgets/property_panel_text.rs:279-289 \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":"crates/op-editor-ui/src/widgets/property_panel_image_node.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64f2cbd72b643fd5b71aa5478fca0dc420b622cebf79b39c121dd95f2eb5955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_flex.rs:384-394 | crates/op-editor-ui/src/widgets/property_panel_text.rs:724-734 \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":"crates/op-editor-ui/src/widgets/property_panel_flex.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"333ec13c51d16e8e8080fa7215a1b9f429840cf6fa1e3fb486bc605e2922ad69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_caret.rs:142-152 | crates/op-editor-ui/src/widgets/property_panel_text_input.rs:62-71 \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":"crates/op-editor-ui/src/widgets/agent_settings_caret.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c80bd6930117a5162c5cf80e337380c68ff7c441b201338885b6265bd6af83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_fill_image_body.rs:52-62 | crates/op-editor-ui/src/widgets/property_panel_image_node.rs:191-201 \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":"crates/op-editor-ui/src/widgets/property_panel_fill_image_body.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"336edcd853ebd27bcbda09348193a917f5ccda249f74ada86f6f0b68c0bd31d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs:476-486 | crates/op-editor-ui/src/widgets/settings_form.rs:37-47 \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":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca4a7e8100a9f9cba489ecfd5c5fff6943f45dcdaf5ae3b3c742053bb5fdc36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/ai_chat_transcript_flow.rs:138-148 | crates/op-editor-ui/src/widgets/ai_chat_transcript_flow.rs:172-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_flow.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdaf8dc4838589bb2e263ad44b402c2fd793806d055b7b46f436fecf37825bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat_turn.rs:307-317 | crates/op-host-services/src/chat_builtin_http_wire.rs:93-103 \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":"crates/op-engine-ffi/src/editor_chat_turn.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e1e5d75733c77a05d68a6bd32673427e00bdbc1072e69cfe3dc98d36542081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat_design_tools.rs:86-96 | crates/op-host-desktop/src/chat_session.rs:554-564 \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":"crates/op-engine-ffi/src/editor_chat_design_tools.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb21bf1a83576c9421c7328a6459b8c7814dc21bd7bd787aba410678e1477ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-desktop/src/iconify_host.rs:248-258 | crates/op-host-web/src/iconify_web.rs:415-425 \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":"crates/op-host-desktop/src/iconify_host.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"022ada9286561dbfd63480e5a9016d8c4b1e21f3d33be30add3ac6759846b58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-desktop/src/persistence.rs:521-531 | crates/op-host-desktop/src/persistence.rs:543-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/persistence.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdf6f8ae6c5ff0cf120a7ab11840a24239d967bea0f611992003c78484de578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-native/src/widget_host/agent_settings_touch.rs:84-94 | crates/op-host-native/src/widget_host/touch_panel_gesture.rs:354-364 \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":"crates/op-host-native/src/widget_host/agent_settings_touch.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc0fb538a70e35cd153d98b988a0b5d89e6b70f3a0fe8f97bcc9b965f15459c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-native/src/widget_host/mode_transition_host.rs:147-157 | crates/op-host-web/src/widget_host/preview_slideshow.rs:103-113 \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":"crates/op-host-native/src/widget_host/mode_transition_host.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d91fe5f8d0bb63067997ecddf83d701aa215c93809219bed89b05d8afacfeea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:15-25 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:113-123 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"239caa4d31e6df6e5e577f37f3e259e76ec15d4a45932774e982348b3639a6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/op-host-native/src/backend/skia/gradient.rs:46-56 | crates/op-host-native/src/backend/skia/gradient.rs:101-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia/gradient.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5332ccd3dbc6e1b46369194ef2e3f46868229e5d884d4a1ae1c3e0fd6e3d00e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-services/src/mcp_serve/design_agent_run_tool.rs:122-132 | crates/op-smoke/src/loop_mode.rs:199-209 \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":"crates/op-host-services/src/mcp_serve/design_agent_run_tool.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efbf23a52a827370ef08eed069fa7e81451b255beb12d2b22362410bc80957d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-web/src/a11y_dom.rs:102-112 | crates/op-host-web/src/ime_input.rs:92-102 \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":"crates/op-host-web/src/a11y_dom.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6539cacc990fbae5417c710e3b822e60f3442ca062ab52ee61db360a333d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-html/src/text.rs:282-292 | crates/op-html/src/text_children.rs:142-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/text.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e82cde617d98cdda665e4d6bf6da6927972d06cc0b6056a51c73f2dcba99de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-mcp/src/insert_node_args.rs:155-165 | crates/op-mcp/src/write_tools.rs:377-387 \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":"crates/op-mcp/src/insert_node_args.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9b8fe465eb643ccb7af1dc0fcaa1fa48e2a99ca6cececcaaec1c46c6ee899e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-orchestrator/src/nav_issues.rs:93-103 | crates/op-orchestrator/src/wire_screen_navigation.rs:297-307 \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":"crates/op-orchestrator/src/nav_issues.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b0f7e292b73eb8d4894d73e0111276f49be93cf0a0e3a58bc9db8388b973a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-orchestrator/src/role_post_pass/layout_props.rs:57-67 | crates/op-orchestrator/src/role_post_pass/layout_props.rs:141-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/layout_props.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e10ce38ad29e65cf85904c557b1a5fb9d8a64f28ef8bd39827fbebc65fb88e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-preview-core/src/present.rs:327-337 | crates/op-preview-core/src/present.rs:339-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":"crates/op-preview-core/src/present.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bade68a7ade063c56412717782f3bd7b4b40edb417ad886812d4bce7d0a1826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-preview-core/src/session_paint.rs:132-142 | crates/op-preview-core/src/transition.rs:341-351 \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":"crates/op-preview-core/src/session_paint.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5949c85c93cd8a48ab010f4e0cd7c95c5176cfaa57ef4acde0a9021bdabc5f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-render-export/src/lib.rs:227-237 | crates/op-render-export/src/pdf.rs:61-71 \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":"crates/op-render-export/src/lib.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"42154d8b82d00c671bc7b6e4d54646c550d9ccace585ae2e9c6e71a3194c48db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/op-orchestrator/src/absolute_child_clamp.rs:144-153 | crates/op-orchestrator/src/absolute_child_clamp.rs:282-291 | crates/op-orchestrator/src/none_stack_inset.rs:27-36 | crates/op-orchestrator/src/section_shell_fill_repair.rs:145-154 | crates/op-orchestrator/src/text_fit.rs:203-212 \u2014 there are 5 copies across 4 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/absolute_child_clamp.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0e0c71e0b4b04d6de66f70226ae9a5dcf6770f3849e074834a2ec4907ff97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/op-ai-skills/src/style_guide/token_table.rs:496-505 | crates/op-orchestrator/src/design_type.rs:162-171 | crates/op-orchestrator/src/plan.rs:501-510 | crates/op-orchestrator/src/plan_fallback_card.rs:26-35 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/plan.rs\u0060 and \u0060crates/op-orchestrator/src/plan_fallback_card.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/token_table.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"21169f364300c23c8b46a504b1cb574079c819779a7adb7f46a4ef9cc94ff32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/op-collab-smoke/src/fault_guest.rs:82-91 | crates/op-collab-smoke/src/fault_guest.rs:157-166 | crates/op-collab-smoke/src/fault_guest.rs:395-404 | crates/op-collab-smoke/src/fault_guest.rs:460-468 \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":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7fc0a88046b772a920c948cb83f53f8ddbaa62169df1efc2341ec687efd151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/op-design-lint/src/node_util.rs:383-392 | crates/op-pen-loader/src/adapter/geometry.rs:22-31 | crates/op-pen-loader/src/authored_geometry.rs:80-89 \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":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d490fd8c6335581a6bc657f4c303ca73d9e465f4209f47a5a2cca544b810c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/op-editor-core/src/instance_override.rs:121-129 | crates/op-editor-core/src/ref_resolve.rs:246-255 | crates/op-editor-core/src/ref_resolve.rs:395-404 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/instance_override.rs\u0060 and \u0060crates/op-editor-core/src/ref_resolve.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4800ddae3826cde9a78e20f40f78595bb68b7a87254c0d3e7f6c8b6b9ed757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/op-editor-core/src/path_bounds.rs:20-29 | crates/op-editor-core/src/svg_path_bounds.rs:16-25 | crates/op-editor-core/src/svg_path_data.rs:171-180 \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":"crates/op-editor-core/src/path_bounds.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9663d7c9fc9b422283784aba186763a12c61eefe0d1478baa48115bde47ba137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/op-host-native/src/backend/skia.rs:390-397 | crates/op-host-native/src/backend/skia.rs:537-546 | crates/op-host-native/src/backend/skia.rs:566-573 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d5a5eed184ce8b1ba68ef0b54b0836be9b49775958b9530a624563a60a1943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/op-html/src/css/cascade_shared.rs:54-63 | crates/op-html/src/css/declaration_syntax.rs:194-203 | crates/op-html/src/css/declaration_syntax.rs:310-319 \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":"crates/op-html/src/css/cascade_shared.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"191110e1081c03de1b4480de08e3bb1a36e936804ea9300f7724508cc701e2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-auth-bridge/src/real_collab_ticket.rs:89-98 | crates/op-auth-bridge/src/real_collab_ticket.rs:123-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/real_collab_ticket.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a2797f3e160d0de4d7315cea26d4b4a3a0c6095ace3375534f0a06cb692513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-chat-agent/src/design_agent_tools/root_seed.rs:310-319 | crates/op-chat-agent/src/design_agent_tools/root_seed.rs:337-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools/root_seed.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54e5c5b0883d290e2212999c50f36002276c4dc55af6097f8f5867bc72e8c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:212-221 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:162-170 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e348f6c340d85eaddb32220cba8945008f93a609bda42534b47e90103f4da88c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-chrome-extension-core/src/design_md_palette.rs:245-254 | crates/op-host-services/src/design_md_evidence_normalize.rs:98-107 \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":"crates/op-chrome-extension-core/src/design_md_palette.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"781ba9d925a43e81b036c4870a34f0d292d0f7b949cd6c0c4c7a0dcc833a3aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-transport/src/admission.rs:142-151 | crates/op-collab/src/protocol.rs:120-129 \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":"crates/op-collab-transport/src/admission.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49cb6d1596d27a215b64ce0271a7ac717497593d0303b5139c53e729cb809fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-host/src/runtime/network/connection.rs:132-141 | crates/op-collab-host/src/runtime/network/connection.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":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95ede0a2c2988e56ca109185a23c49a0b81235c8068aed849932526cfde45dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-relay-locator-hsm/src/server.rs:282-291 | crates/op-collab-relay-locator-server/src/hsm.rs:261-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-hsm/src/server.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d00093bda0252da035422aa61292beda5d9cd794147cf49e5a2636804aeb445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-relay-server/src/connection_reauth.rs:251-260 | crates/op-collab-relay-server/src/connection_reauth.rs:295-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection_reauth.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a07956934a12773e616d1cbc330810ab2e9c19485d2b29b3d9511e59bcd2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:341-350 | crates/op-collab-smoke/src/fault_owner.rs:397-406 \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":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e581dc1c15f7ef19c61d725a2c789f1b0dd94ed1428aeb3d444bddd86adef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-smoke/src/fault_transport.rs:53-62 | crates/op-collab-smoke/src/owner.rs:84-93 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_transport.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2d30285ed3a329b782129b0b483f9a4a0ad926f00cc910cd94960456a233f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab-smoke/src/fault_transport.rs:81-90 | crates/op-collab-smoke/src/guest.rs:33-42 \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":"crates/op-collab-smoke/src/fault_transport.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62e116585098384b04c5e6b10d933c99d9935d0ea4dc0a6114953a9f0728ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-design-lint/src/detectors/spacing.rs:55-64 | crates/op-design-lint/src/detectors/spacing.rs:70-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d0586ce5a86d328b14ac17935f28651476ff92247f2eddb8a338f5f277288a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-core/src/icon_path_normalize.rs:489-498 | crates/op-editor-core/src/icon_path_normalize.rs:513-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd28addc9a7295d4e86e43efb29613cd6d9e71083c9b706d79229b4136735c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-core/src/mutators.rs:550-559 | crates/op-editor-core/src/mutators.rs:576-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/mutators.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6edb17dddc0a3fdc073ea84deeae49a08663f3f6d8df6c72b736765da9e4937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:144-151 | crates/op-editor-core/src/svg_import/path_data.rs:168-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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3329b7f2e8eb39cb020167fe6e213d8751daa515de8a510bac70e6e1b6aaf734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-core/src/conversion.rs:203-212 | crates/op-editor-core/src/conversion.rs:238-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/conversion.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba35ee9987b390336d0bae7c9ab5d78f6d30bb04e815ff50f6f0cfae9538b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-core/src/color_picker_snapshot.rs:27-36 | crates/op-editor-ui/src/widgets/variables_panel.rs:329-338 \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":"crates/op-editor-core/src/color_picker_snapshot.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2edff966187a7f7a55aff1230af8a7a681c4c5389ed20e769e10362455d0f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-core/src/fills/edits.rs:156-165 | crates/op-editor-core/src/fills/primary.rs:154-163 \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":"crates/op-editor-core/src/fills/edits.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c72d0498e992eb230ac5caa5d121b625062a11114cba31e3dca101e95fa498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/svg_export.rs:538-547 | crates/op-host-native/src/backend/skia/path.rs:736-745 \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":"crates/op-editor-ui/src/svg_export.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c578b46049405ffedc5b677011a1d0bc36869a709eae0f9dc2be65910dfb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_account.rs:138-148 | crates/op-editor-ui/src/widgets/agent_settings_account.rs:208-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_account.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3217a930cdd3ad5a97deb0b2cf4d0b824fdadee0d24ecde3c519a1f4358e4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/toolbar.rs:206-215 | crates/op-editor-ui/src/widgets/toolbar.rs:250-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/toolbar.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"081696066488faa73e725d5967843ea1dbfa90a86d2d0f00d1b4ea8b1c257987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/scene_template_card_paint.rs:248-257 | crates/op-editor-ui/src/widgets/scene_template_card_paint.rs:598-607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_card_paint.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e92d189f5382d55daa93b2355c13e274a9020260a3091b7eae4886355d335e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:175-184 | crates/op-editor-ui/src/widgets/variables_panel/paint.rs:671-680 \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":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f347339cd36e7519d778dcbed8f8622e03b84482a0e80741d426792acc6c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs:94-102 | crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:740-749 \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":"crates/op-editor-ui/src/widgets/agent_settings_builtin_form.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d91208bd93ded33f4a2df7193f7d302ea84a26dd9cfc2c02fc8db245e55833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs:170-179 | crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs:295-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"370feb58d131b8d419fa9aafb6f9850ab0c706b04be555909f402c7d8e5c1b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-engine-jni/src/bindings.rs:204-213 | crates/op-engine-napi/src/bindings.rs:216-225 \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":"crates/op-engine-jni/src/bindings.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6392b642c71734ac20883af2cebc6009c0e9ef4399bc6a15937246910e3ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-figma/src/instance.rs:121-130 | crates/op-figma/src/instance.rs:131-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a097c753846bcd214470c690590446e7cfc575133b2ccfd37d9fdfd4f09a2578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/op-host-desktop/src/figma_import_session/publish.rs:178-185 | crates/op-host-desktop/src/figma_import_session/publish.rs:200-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/figma_import_session/publish.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae8cfd10071d433952abe9ab459e4d13c420aafe73d87112df1c6d2cd7a2406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-desktop/src/image_panel_host.rs:215-224 | crates/op-host-web/src/web_image_panel.rs:264-273 \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":"crates/op-host-desktop/src/image_panel_host.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"814da49f3e89be1d08a9448db9e10d8412785c50b5f6e4c5067e3d466878bc05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-desktop/src/design_session_workers.rs:529-538 | crates/op-host-desktop/src/design_session_workers.rs:547-556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session_workers.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9450bc5e1180486a4e0041082a1a293fed362ee601e31deea862ec03373cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/backend/skia.rs:37-46 | crates/op-host-native/src/backend/skia/image.rs:29-38 \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":"crates/op-host-native/src/backend/skia.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8796a20dfdff62c63c501f3af487ef58ebc51f9e0ea4968bc4f64059461a804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:282-291 | crates/op-host-web/src/widget_host/slides_panel.rs:148-157 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f67b1a74d991dd5f0b5d6063eeef55efb65722857235cbd06e750eb5b6bc6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:303-312 | crates/op-host-web/src/widget_host/slides_panel.rs:167-176 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6368485ead17f8a317ea2a6177cef9349f49823f94d47ee1232606533ac66fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/widget_host/input.rs:213-222 | crates/op-host-web/src/widget_host/node_drag.rs:124-133 \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":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc364c5a31ec5f034cf9480eec80c4d4906c8e83977e827e12cab75ecc26e37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-services/src/export_html_structured.rs:249-258 | crates/op-host-services/src/export_pptx.rs:387-396 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/export_html_structured.rs\u0060 and \u0060crates/op-host-services/src/export_pptx.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_html_structured.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aabf0dc8d9c47ae64108fd1d283e8d52ece44c32935835191413d6852384add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/op-host-services/src/import_html_url.rs:54-63 | crates/op-mcp/src/import_common.rs:131-138 \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":"crates/op-host-services/src/import_html_url.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c61ec6bc2560ce6d331e73fc493925a6b195fd6ac4ec59396a151641152ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-services/src/mcp_serve/enrich_images_tool.rs:312-321 | crates/op-host-services/src/mcp_serve/finalize_tool.rs:163-172 \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":"crates/op-host-services/src/mcp_serve/enrich_images_tool.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"af607b324d1e822c0d1adab36e1c81094af9fd4fb6f7cec1000b4983ad160398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-services/src/web_static.rs:224-233 | crates/op-host-services/src/web_static.rs:242-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_static.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5648459110375353c0ba402908e681099e86a47cabb04342f0fd5adb4c6a2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-services/src/export_pptx/picture.rs:108-117 | crates/op-host-services/src/export_pptx/picture.rs:129-138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/export_pptx/picture.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdebdaaf71d45881e6f2ee4d53aa3196279736ad7a431c05756b659a5032911e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-host-services/src/mcp_serve/sniff.rs:15-24 | crates/op-host-services/src/mcp_serve/sniff.rs:33-41 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/sniff.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40b2a700840c482ab7cab4d179fc5143c378973e7667ffe5ae6d1b73a73e539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-web/src/dom_io/html_directory_session.rs:472-481 | crates/op-html/src/project.rs:328-337 \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":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35fbb5e93c9809b5a7842499884cbe1c64b60e3f28f7cdb1e3a3e2e79295961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-web/src/dom_io.rs:359-368 | crates/op-host-web/src/dom_io.rs:399-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e2f3af0a1db92fbc86779c04767373bf6ef0c9d745e9e3b359739854aceb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-html/src/project.rs:216-225 | crates/op-html/src/project_zip.rs:256-265 \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":"crates/op-html/src/project.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce2378e075d3e24f26f686db2b76c0fab813f4ee7cc74cae972db7e0a5f8dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-mcp/src/batch_design_result.rs:222-231 | crates/op-mcp/src/design_refine_result.rs:61-70 \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":"crates/op-mcp/src/batch_design_result.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f26f76c40f13aa28947ad991bd2f69f438b32cdfd7c5e6825139239d3655cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-mcp/src/batch_get.rs:354-362 | crates/op-mcp/src/style_ops_tools.rs:354-363 \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":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe17e3e78610759d19aa7b82a031435ecb4265e7cf09ff56f69a9a834cafb307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-mcp/src/page_tools.rs:135-144 | crates/op-mcp/src/page_tools.rs:249-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/page_tools.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"732337651f535b68394d85d94a13b3fafa59847af25d13c23379866b5ed9a022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-orchestrator/src/cleanup_equalize_siblings.rs:343-352 | crates/op-orchestrator/src/cleanup_equalize_siblings.rs:406-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11fc2955229ae587059873ba68425c60994ac02e67de5ed963f340e39a1bbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-orchestrator/src/cleanup_root_and_nav.rs:270-279 | crates/op-orchestrator/src/cleanup_root_and_nav.rs:336-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_root_and_nav.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d91856559624ac0f81819e5a79a53ecb919e2b3f855ab465f59ec37eb84add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-orchestrator/src/validation_fixes_apply.rs:248-256 | crates/op-orchestrator/src/validation_fixes_apply.rs:297-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a49ce2571551e4825eca4839b949d13b70ba536591cfd73c8ef10b8096fc6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:227-236 | crates/op-orchestrator/src/touch_target_floor.rs:179-188 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5fdb22ec6de55d0d5fd93cedf5a78b864c7a54a1831cde98962b672db598cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-preview-contracts/src/effect.rs:68-77 | crates/op-preview-contracts/src/effect.rs:117-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-contracts/src/effect.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae12feff3dd701c9da4f6f201f8c7affa017154740881d9d82ecdf772a5e71d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/op-preview-core/src/present.rs:180-188 | crates/op-preview-core/src/present.rs:190-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffefc41897206446d83001fcfdf28263a8801fdb65f5598a4712da804b120ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 10): crates/op-collab/src/diff_index.rs:122-130 | crates/op-editor-core/src/command_refine.rs:181-189 | crates/op-editor-core/src/export_name.rs:163-171 | crates/op-host-services/src/chat_system_prompt.rs:195-203 | crates/op-mcp/src/batch_get.rs:435-443 | crates/op-mcp/src/open_document.rs:162-170 | crates/op-orchestrator/src/validation_dump.rs:242-250 | crates/op-orchestrator/src/validation_fixes_apply.rs:641-648 | crates/op-orchestrator/src/validation_fixes_b3.rs:490-498 | crates/op-smoke/src/audit_rubric.rs:245-253 \u2014 before extracting anything, compare \u0060crates/op-collab/src/diff_index.rs\u0060 and \u0060crates/op-editor-core/src/command_refine.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/op-collab/src/diff_index.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4208a133317b768cfa7be4d908b410a233f121259a66935310ab62fe2bc27e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): crates/op-collab/src/diff_index.rs:134-142 | crates/op-editor-core/src/command_refine.rs:193-201 | crates/op-host-services/src/chat_system_prompt.rs:205-213 | crates/op-mcp/src/batch_get.rs:445-453 | crates/op-mcp/src/open_document.rs:172-180 | crates/op-mcp/src/tools.rs:45-53 | crates/op-orchestrator/src/validation_dump.rs:252-260 | crates/op-orchestrator/src/validation_fixes_apply.rs:650-658 | crates/op-orchestrator/src/validation_fixes_b3.rs:500-508 \u2014 before extracting anything, compare \u0060crates/op-collab/src/diff_index.rs\u0060 and \u0060crates/op-editor-core/src/command_refine.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/op-collab/src/diff_index.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d85484230d33825209e30a7bd4969f8622b52fa8208118e54ac213afc2be418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): crates/op-host-desktop/src/git_jobs.rs:95-103 | crates/op-host-desktop/src/git_jobs.rs:207-215 | crates/op-host-desktop/src/git_jobs.rs:245-253 | crates/op-host-desktop/src/git_jobs.rs:289-297 | crates/op-host-desktop/src/git_jobs.rs:345-353 | crates/op-host-desktop/src/iconify_host.rs:67-75 | crates/op-host-desktop/src/update_check.rs:103-111 | crates/op-host-services/src/acp_agent_probe_host.rs:107-115 | crates/op-host-services/src/provider_probe_host.rs:69-77 \u2014 there are 9 copies across 5 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/git_jobs.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82b00e090b4c797730454697954b0e1c3437b262acf24484a82689181da06fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/op-orchestrator/src/category_grid_reflow.rs:120-128 | crates/op-orchestrator/src/geometry_bottom_gap.rs:81-89 | crates/op-orchestrator/src/geometry_validation.rs:223-231 | crates/op-orchestrator/src/geometry_validation.rs:388-396 | crates/op-orchestrator/src/radial_repair.rs:433-441 | crates/op-orchestrator/src/sidebar_archetype.rs:18-26 | crates/op-orchestrator/src/stub_repair.rs:10-18 \u2014 there are 7 copies across 6 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/category_grid_reflow.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff71d69ded98a8bb79fb526cb3ab6ffe23d038ed65440804b3ba47db9875cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:283-291 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:381-389 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:509-517 | crates/op-editor-ui/src/widgets/property_panel_layer.rs:227-235 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a6f553c8ff95c0a67a3dfe294f480b642fffaafc3fcd3ce7d78e1195abcee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:262-270 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:323-330 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:225-233 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:277-285 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ef1a8c5a0e62bbde4cfc2dbf897344113251a2e3a77a6b1d72493c634e6516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-design-lint/src/node_util.rs:395-403 | crates/op-pen-loader/src/adapter/geometry.rs:32-40 | crates/op-pen-loader/src/authored_geometry.rs:90-98 \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":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f45f28ea4eec248a91e7605eb8f7b081f118a527316d588b49cbe973a503a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-editor-core/src/color_picker_snapshot.rs:28-36 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:381-389 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:323-331 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-editor-core/src/color_picker_snapshot.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fc853e43168af7d602974894b89644eacf9a3e22b850310139a9fde59293fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-editor-core/src/fills/primary.rs:42-50 | crates/op-editor-core/src/fills/primary.rs:64-72 | crates/op-editor-core/src/fills/primary.rs:90-98 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/fills/primary.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"40688bc15eadcbe2cb395510140ed62cd3b6f2c65ef5d070e883715b242939d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-host-services/src/doc_io.rs:176-184 | crates/op-host-services/src/doc_io/clean_copy.rs:62-70 | crates/op-host-services/src/doc_io/clean_copy.rs:124-132 \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":"crates/op-host-services/src/doc_io.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a09cae9eebf18f57d4597e250e663afc42efd0db698799c85f2df9555ed5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-pen-loader/src/widget_payload.rs:28-36 | crates/op-pen-loader/src/widget_payload.rs:48-56 | crates/op-pen-loader/src/widget_payload.rs:68-76 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/widget_payload.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3e2784a5cbade38bde6b01c719f2c7dddea09731a80f9117bf210f3a2f392a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-auth-bridge/src/collab_claims.rs:504-512 | crates/op-collab/src/profile_validation.rs:99-107 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab/src/profile_validation.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d3d71f6daa8db349cd71ac3d86da83d74e783f4855266c04a8378a7fde0353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop.rs:429-437 | crates/op-host-services/src/chat_builtin_http_wire.rs:72-80 \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":"crates/op-chat-agent/src/chat_agent_loop.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2c686dfcada7685f2cbfbe2345a356d8de17cb75b883e6aa203d58d8b78b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-cli/src/app_control_cli.rs:194-202 | crates/op-cli/src/app_control_cli.rs:308-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/app_control_cli.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8750aae90cf247d9569ef2c7f755f314882741cf820dfaa8b5b792bdbe1d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-cli/src/command_mappers.rs:75-83 | crates/op-cli/src/command_mappers.rs:90-98 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/command_mappers.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e2d6b08f6d9da0ce813a773d77cab959536fa911668008120bd3b39fca5e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab/src/apply_tree.rs:56-64 | crates/op-collab/src/apply_tree.rs:89-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/apply_tree.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"817d3d02cfe326f05cb12aa35f9816878ef329ede564f6d190dc00e3acd665ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab/src/guest_pending.rs:313-321 | crates/op-collab/src/reapply.rs:44-52 \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":"crates/op-collab/src/guest_pending.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"35711d2637f3a33a567280cc7a71b405505a6037db8d1575ca61cc8b56053378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab-policy-file/src/lib.rs:251-259 | crates/op-collab-relay-server/src/x25519_boundary.rs:240-248 \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":"crates/op-collab-policy-file/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26c547b4e6057933eada67227eb84a44f0e63fb63da45ba8c2b66fe0bc6b90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab-relay-protocol/src/invite.rs:74-82 | crates/op-collab-relay-protocol/src/locator.rs:254-262 \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":"crates/op-collab-relay-protocol/src/invite.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b334afd9a53f9459e2703a0a7080b3b1a40b560eaad889af7be6346d7a78f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:167-175 | crates/op-collab-smoke/src/fault_owner.rs:208-216 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20dd9f29bace0e4eed7a89ac70b93f1510f2ebe382c57974812ebec416f3166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:228-236 | crates/op-collab-smoke/src/fault_guest.rs:460-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7037b8059411aa04c64f75b37d4241d4f6e41ff2998ed2bea9aca41ff58406bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab-transport/src/queue.rs:350-358 | crates/op-collab-transport/src/reassembly_budget.rs:86-94 \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":"crates/op-collab-transport/src/queue.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a5710c9de2c667c319785766bf2676ef404452b6ee1eaecf17055c24fe166d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/op-config-store/src/lib.rs:308-314 | crates/op-git/src/lib.rs:166-174 \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":"crates/op-config-store/src/lib.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa218c6a01676c4424e2614e2128782dc21e72fe135a1b74cc8e6c965262a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-design-lint/src/node_util.rs:366-374 | crates/op-editor-core/src/variables_resolve.rs:91-99 \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":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f856338a481b16fc20ba87a52c96061836a72bc5e74cb02251a1874af680618c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-core/src/agent_settings_builtin_models.rs:141-149 | crates/op-editor-core/src/agent_settings_builtin_models.rs:185-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/agent_settings_builtin_models.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4551b2541a23c6a2af7b11db496f791cde1a42ad4acead4fd2da8e41c53ea3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:380-388 | crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:421-429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c533c5bea657e572f4447d0afbef90dea761baaff51d41c28fc455bd6ea4a521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_fonts.rs:200-208 | crates/op-editor-ui/src/widgets/agent_settings_fonts.rs:284-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_fonts.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0674dd781fa99298f1178b9c53e01fc9e045c7b41a0b3db6635cfce7fbe321b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_frame_labels.rs:141-149 | crates/op-editor-ui/src/widgets/canvas_frame_labels.rs:166-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_frame_labels.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4756a590659bf90dbf2f359257642ae2d2dd582bdbe3d4e1729f880c3c2dc7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/figma_import.rs:262-270 | crates/op-editor-ui/src/widgets/icon_picker_panel.rs:300-308 \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":"crates/op-editor-ui/src/widgets/figma_import.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3cda882daa0b4ac0b3d61ee115867b85278ab9752851b42c143fc90fc3be57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/figma_import.rs:350-358 | crates/op-editor-ui/src/widgets/figma_import.rs:367-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/figma_import.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3286e22a6eeade32b210b33488b12dbbe3297a40eef9a1826bd7d03804aec34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint_art.rs:429-438 | crates/op-editor-ui/src/widgets/home_surface_paint_art.rs:462-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":"crates/op-editor-ui/src/widgets/home_surface_paint_art.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"820b6c8ed792b4f816fd50963036bef8558eb6c62a711cca156ac846369c35c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/prompt_center_panel.rs:496-504 | crates/op-editor-ui/src/widgets/scene_template_panel.rs:559-567 \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":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fbb44e97e9ecdfdbeac4b033eb78e84feeeb37b5a3c9214d6edd4e3a8ff162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_input_layout.rs:73-81 | crates/op-editor-ui/src/widgets/property_panel_layout.rs:525-533 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_input_layout.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_layout.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e242c9b039c41ae3e6eae2a3dd5ec88e915f986079bb9c7a99e82d63c0adaae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:252-260 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:354-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7eb20f67fff64a7b7658b5e885290161c19e43423bbe2ba17e4db7838da49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-desktop/src/cursor_icon.rs:35-43 | crates/op-host-desktop/src/cursor_icon.rs:46-54 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/cursor_icon.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08a0178ce0889a299ac465143442061c43262365169ca1860f6981324587bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:271-279 | crates/op-host-web/src/widget_host/slides_panel.rs:138-146 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3e7439f4ea126b9e45bb21d3fbbdde9034126b7d82f5171bd948c8bcf4b1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:166-174 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:55-63 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4852fb435caebfbfd73090f1b635560604715d5066cf0fe2c1f85f838f60c648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-native/src/backend/skia/gradient.rs:36-44 | crates/op-host-native/src/backend/skia/gradient.rs:91-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia/gradient.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abf917a3ae494a95eca5e019b57a9e579a28a4175d7a88e91316cdbf0649e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-services/src/public_https_client.rs:38-46 | crates/op-host-services/src/public_https_client.rs:62-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/public_https_client.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7f96289d6d15415222024b2537675d44a86dbe61ffc36b532da5260203c72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-services/src/design_session.rs:55-63 | crates/op-host-services/src/design_session.rs:314-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/design_session.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd83e2aa6c815be8bedf083d72bf2d6c57ee0ad1221a46baa861d5464534203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/op-host-services/src/design_md_llm.rs:73-80 | crates/op-orchestrator/src/design_system.rs:381-389 \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":"crates/op-host-services/src/design_md_llm.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cec9724e7a0825c07e82117bca5b537ce24131871abc336fcc271950ed2597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-web/src/dom_io/browser_files.rs:195-203 | crates/op-host-web/src/dom_io/browser_files.rs:337-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":"crates/op-host-web/src/dom_io/browser_files.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2e5c47bde9cb9ad3d469f25854d00fab064008814dfdbe64cb9afd03236ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:391-399 | crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:423-431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_edit_ops.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"785e7871bbd15ac454f28caf59285cc3a475437b12cd7d4275a3e2f512343866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-html/src/css_encoding.rs:13-21 | crates/op-html/src/html_encoding.rs:15-23 \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":"crates/op-html/src/css_encoding.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b7140bbff4e9122fb9fd4e600b83bc272fe8a27f07f29db48671c338ad8d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-image-enrich/src/net/fetch.rs:211-222 | crates/op-image-enrich/src/net/providers.rs:451-459 \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":"crates/op-image-enrich/src/net/fetch.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4062eda2cce4a5d873ed15b23dc14f9ec9cb0aa26b647f43c840104e3ace476e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/bulk_vars.rs:64-72 | crates/op-mcp/src/bulk_vars.rs:99-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/bulk_vars.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ca50c91cc278eaecd378f9661d3ce3a5cb56a5aab0892c30aeff72356e4c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/codegen_plan_store.rs:228-236 | crates/op-mcp/src/codegen_plan_store.rs:323-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e422393a50750e635b0d33b205256b8c42878ed2ee00eb2d15d044469fcfe1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/component_tools.rs:62-70 | crates/op-mcp/src/page_tools.rs:173-181 \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":"crates/op-mcp/src/component_tools.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a474e80b84bc6468b7e8afe66f887a47b6a82cd3da59064534fb898e1df17d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/insert_node_args.rs:95-103 | crates/op-mcp/src/selected_ops_tools.rs:76-84 \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":"crates/op-mcp/src/insert_node_args.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a452c76207d900ea832498c3bfdc552ee023992a2037141f5d8d5f310ecf9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/category_grid_density.rs:202-210 | crates/op-orchestrator/src/repair_record.rs:417-425 \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":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6bf2003569ab1c7dd73caf03f085a98e76cc72cb16f0c67bbc372ef4483940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/design_type.rs:168-176 | crates/op-orchestrator/src/design_type.rs:186-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/design_type.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"52947614b8dff53e5db25bcfe2ba170f02e9f3b5084906d489b3d17404370f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/motion_recipes.rs:269-277 | crates/op-orchestrator/src/reference_skeleton.rs:182-190 \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":"crates/op-orchestrator/src/motion_recipes.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee57907dd468e90d4fd8927fc0e5deb2dcbebcdc4fd1ccd2f4de088fa1a6fc6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/retry_subtask.rs:37-45 | crates/op-orchestrator/src/spawn_concurrent.rs:109-117 \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":"crates/op-orchestrator/src/retry_subtask.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b7a79f8bee18c9ce86283c4f07c8670ef229d8f0837b3df679a5c9e2870a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/validation_fixes.rs:159-167 | crates/op-orchestrator/src/validation_fixes_b3.rs:34-42 \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":"crates/op-orchestrator/src/validation_fixes.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3858e83df5d6fc2abfaf39efb968de3842dcab7c6c53f515aae58e1fed796b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/spacing_repair.rs:160-168 | crates/op-orchestrator/src/spacing_repair.rs:199-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/spacing_repair.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d5c64f59b41015fd60626622a856b4c51a29b35f82d44afacf33bd61295b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-orchestrator/src/mobile_content_rail_detect.rs:113-121 | crates/op-orchestrator/src/mobile_content_rail_detect.rs:145-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_content_rail_detect.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f28903b8573cbdfeae61b3106fb03e40a3df51b5a8221d158dd864280164413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/op-pen-loader/src/editor_scene.rs:16-24 | crates/op-pen-loader/src/layout_scene.rs:81-87 \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":"crates/op-pen-loader/src/editor_scene.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8906e3349b9318acb4f607b36be5c43f8230dda2d592bbbec283b3c880f17821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-preview-core/src/motion.rs:401-409 | crates/op-preview-core/src/motion.rs:441-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/motion.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"475ab4209ffee20983d8d31655c9710c1ab80dbc8345e17ef969520aca542ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/op-editor-core/src/image_crop.rs:225-232 | crates/op-editor-core/src/property_edit_mutators.rs:667-673 | crates/op-editor-core/src/property_edit_mutators.rs:703-709 | crates/op-editor-core/src/property_edit_mutators.rs:722-728 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/image_crop.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1259c83dc5fdc0cd35b2ee62a78420226b03a9ab91ceeb9f8a33cadbcab377ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_input_layout.rs:74-81 | crates/op-editor-ui/src/widgets/property_panel_layout.rs:526-533 | crates/op-editor-ui/src/widgets/property_panel_sections.rs:471-478 | crates/op-editor-ui/src/widgets/property_panel_sections.rs:608-615 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/property_panel_input_layout.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/property_panel_layout.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfd53989f7557053f645642f4ab1882fdb836683646423b63619ed3d28455b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-collab-relay-locator-server/src/http.rs:363-370 | crates/op-collab-relay-locator-server/src/http.rs:438-445 | crates/op-collab-relay-locator-server/src/http.rs:503-510 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-server/src/http.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55b5c3a47b95567c9e2ef8fe94990635b004fc086850439dc9f51d79b42a87a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-editor-core/src/agent_indicators.rs:707-714 | crates/op-editor-host-core/src/chat.rs:109-116 | crates/op-editor-host-core/src/chat.rs:133-142 \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":"crates/op-editor-core/src/agent_indicators.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2331dd4fddcb499d0ea442aa958386e756470f02bc00b05fc783929921fccb58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-mcp/src/write_tools.rs:459-466 | crates/op-mcp/src/write_tools.rs:513-520 | crates/op-mcp/src/write_tools.rs:583-590 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/write_tools.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8a9e4e6da479f9c898dc76911b52b3976ac062dd3cdbe3cdf18db0b119ee0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-chat-agent/src/design_agent_tools/quality_scans.rs:258-265 | crates/op-orchestrator/src/role_post_pass/surface_structure.rs:362-369 \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":"crates/op-chat-agent/src/design_agent_tools/quality_scans.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"277bec6047a39272b531a352aa90d74d2d594060826a5280c598a5227031b85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-collab/src/apply.rs:221-228 | crates/op-collab/src/apply.rs:285-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab/src/apply.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51d7115c8938da8b7bb802b8c1f66eba7b4809ccda947b9b18a51ea58a698d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-collab-relay-client/src/session.rs:454-461 | crates/op-collab-relay-client/src/session.rs:473-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-client/src/session.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"249f2e9de7fdf9067df0224c0d754f9976b246313a61c9d6df29ac3fc6afa125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-collab-transport/src/runtime.rs:97-104 | crates/op-collab-transport/src/runtime.rs:106-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":"crates/op-collab-transport/src/runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf493ebdb686c5e3e5f85a91b6a37b83fb7f7679b79ecb9ddca8abc7346406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-core/src/collab_ui_state.rs:169-176 | crates/op-editor-ui/src/widgets/collab_avatar_paint.rs:16-23 \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":"crates/op-editor-core/src/collab_ui_state.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6b095c6c3ca131dd24f1b544e37c727aebe625bc0c2d4000e2d7e7c1576654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-core/src/icon_path_normalize.rs:378-385 | crates/op-editor-core/src/icon_path_normalize.rs:397-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":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f9969829bb0fc7044c10554110e37ef06a875facf0c53e42633220b31dc5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-core/src/prompt_center_catalog.rs:290-297 | crates/op-editor-core/src/scene_template_catalog.rs:666-673 \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":"crates/op-editor-core/src/prompt_center_catalog.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffa84b818967cd0c6acece3a9bef34d2b965b2d1bfb7dbc9aed49e664ce4edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_acp.rs:433-440 | crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:693-700 \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":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b6ee3a795bc3144697d251e83d2bf92fc17716e6faa94d8b811746234d8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs:320-327 | crates/op-orchestrator/src/parse.rs:330-337 \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":"crates/op-editor-ui/src/widgets/ai_chat_transcript_design.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddb3ed0bf8b937ee564e4a9640be99ae4025688c877f32a75d84ff5ebc73045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_text.rs:162-169 | crates/op-editor-ui/src/widgets/canvas_viewport_text.rs:430-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_text.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e6ab4a0d05163baff03a94baa3ffabfae13c71690f91ea3abee24da19d98c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/op-editor-ui/src/widgets/font_picker_cache.rs:78-85 | crates/op-editor-ui/src/widgets/layer_panel_cache.rs:216-222 \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":"crates/op-editor-ui/src/widgets/font_picker_cache.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f92170607f0fbe7b3902fa2c136675a2f083ecf23351570eca5869c01c68f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/layer_context_menu.rs:328-335 | crates/op-editor-ui/src/widgets/path_anchor_context_menu.rs:117-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_context_menu.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"53673d9609561439972773d0443a209824062ae67e143a738b583ee68dd094fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/mobile_chrome.rs:709-716 | crates/op-editor-ui/src/widgets/mobile_chrome.rs:750-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/mobile_chrome.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4119350db1dc07c2955651686fb83aaa04ec21160dd8073436ce388ad8ecbf53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/preview_device_switcher.rs:88-95 | crates/op-editor-ui/src/widgets/screen_switcher_pills.rs:118-125 \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":"crates/op-editor-ui/src/widgets/preview_device_switcher.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"323680e75d03108d6c02081be575db2a06180a691b0f30053ec9ee27a4031cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_effects.rs:334-341 | crates/op-editor-ui/src/widgets/property_panel_fill.rs:601-608 \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":"crates/op-editor-ui/src/widgets/property_panel_effects.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b838117f29037d940894fd8f7f2a03117ec1b735f9003e1e0ba206521ff94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_inputs.rs:253-260 | crates/op-editor-ui/src/widgets/property_panel_inputs.rs:480-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_inputs.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20e4356801ca4e46993fb0ca319087c9452eb2a32eb18d2083348d87d8b9a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:44-51 | crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:233-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fd1fb78bcf872113ba347044f04a0cd28f62763d6cf2ab605b473d02ae5d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-engine-ffi/src/desc.rs:348-355 | crates/op-engine-ffi/src/lifecycle.rs:416-423 \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":"crates/op-engine-ffi/src/desc.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de7eb34491ecb9c12e6d895a2a3ff47f07ce5b8c530c107ed5e1f7533066ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat_design.rs:75-82 | crates/op-host-desktop/src/chat_session_launch_design.rs:98-105 \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":"crates/op-engine-ffi/src/editor_chat_design.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38219cdf0a973ef9f707aadb9a2b388feb1849b5c4af01b8ab7eedd47e26920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-engine-jni/src/callbacks.rs:62-69 | crates/op-engine-napi/src/callbacks.rs:53-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/callbacks.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbafd5a81870bfb9ec0e7dfbdb9e84a283e90bd9b27b0c341fa93f0796ac74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/op-figma/src/vector_decoder.rs:214-220 | crates/op-figma/src/vector_decoder.rs:224-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a8597d63e65490c8eb472abecbafa868a6c6d2081ef0842a9862826bd33328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/op-host-desktop/src/design_md_host.rs:381-388 | crates/op-host-desktop/src/design_md_host.rs:491-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_md_host.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2313890eb7f36f273aba23ae47113f71a7a0c1c368ae35dacd8e51524cb6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-desktop/src/mcp_integrations.rs:369-376 | crates/op-host-desktop/src/mcp_integrations.rs:430-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":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c5eba5a6ff043a167f200a5af654babf05e66840d61e8d33ca375214d00bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-desktop/src/mcp_integrations.rs:488-495 | crates/op-host-desktop/src/mcp_integrations.rs:513-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":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3722d07786dc104db1c070a1dc31f5f0789ffc184b7ecba24cc875e630a293a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-desktop/src/app_handler/pointer_events.rs:48-55 | crates/op-host-desktop/src/app_handler/pointer_events.rs:120-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8c84c193f6e01d07c95d2626311f5045c3f5f7be58bea59f7584d646791460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/backend/skia/path.rs:208-215 | crates/op-host-native/src/backend/skia/path.rs:233-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/backend/skia/path.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fa81d33f340afba610ed02adc4599efff09e3c726564c398fd902cba79600f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/canvas_pan_cache.rs:79-86 | crates/op-host-native/src/widget_host/paint_pan_cache.rs:201-208 \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":"crates/op-host-native/src/widget_host/canvas_pan_cache.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb89dc4b5a19c69ca2ae4a6088495d70e2e0ab517734cf0039f27b08caf765b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/touch_panel_gesture.rs:53-60 | crates/op-host-native/src/widget_host/touch_panel_gesture.rs:269-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/touch_panel_gesture.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c381394928d580a1cace941bcabc64fd3ee49a3ef72f2eb93f1cc4948caafd28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:90-97 | crates/op-host-web/src/widget_host/variables_preset_press.rs:67-74 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd6bd18c6a79e4159d6427af827262ebd7be0b85a2b5cf7ddab87c9ed5ccbe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/mode_transition_host.rs:130-138 | crates/op-host-web/src/widget_host/preview_slideshow.rs:224-231 \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":"crates/op-host-native/src/widget_host/mode_transition_host.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ba4078a977483fcf58736b08740bcc89d1889fe65ece349042c16bf53dbb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/paint_pan_cache.rs:27-34 | crates/op-host-native/src/widget_host/paint_pan_cache.rs:39-46 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint_pan_cache.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e63373dcbef8421723c8f7a3b04470a3a0174d49fc1441e193dedb803c8f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:39-46 | crates/op-host-web/src/widget_host/preview_slideshow.rs:43-50 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eff7aac6b93e252e3d2797d09df79ce99408529acbbdda7790f90067af16e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-services/src/chat_intent.rs:594-601 | crates/op-host-services/src/chat_intent.rs:614-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":"crates/op-host-services/src/chat_intent.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b344a0d47ef753aeb1caba8e3e805ce5fbd0015d8e8b365c58fdef2218bd005c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-services/src/doc_io.rs:261-268 | crates/op-host-web/src/file_actions.rs:376-383 \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":"crates/op-host-services/src/doc_io.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8d3937745779a4da5e5efcdbc30585821d2053ff1d9672566cf8fde74304cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-services/src/model_discovery.rs:191-198 | crates/op-host-services/src/provider_probe_models.rs:107-114 \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":"crates/op-host-services/src/model_discovery.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"134a8de6ecd57df9daf4519bd666cac467fd1a69c3d3e73e0f079d962638d46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-services/src/model_discovery.rs:330-337 | crates/op-orchestrator/src/plan.rs:161-168 \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":"crates/op-host-services/src/model_discovery.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f37b8c165406bdc85caf67406d15ecfad095bb17cfb8d5b3947d4446d2a3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-web/src/dom_io/browser_files.rs:185-192 | crates/op-host-web/src/dom_io/browser_files.rs:323-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/browser_files.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3448ade37101ad00266b088486c41a176157c53dc3112aa2ad3b0f1169957af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-html/src/color.rs:122-129 | crates/op-html/src/color.rs:176-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/color.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8907e171bd63fc09eedf63dae8d194688ae8f8346c38f5537f338f623cd7dbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-html/src/project_zip.rs:258-265 | crates/op-html/src/project_zip_range.rs:298-305 \u2014 before extracting anything, compare \u0060crates/op-html/src/project_zip.rs\u0060 and \u0060crates/op-html/src/project_zip_range.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b851e61dc71fdfe29e68a88c7bd875ad9a85dad461c34d08895a3f3a91802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-html/src/special.rs:205-212 | crates/op-html/src/special.rs:266-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":"crates/op-html/src/special.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b53a24a09ee56167481de7317c559680a32fc2802155e2d3058c1596eeb7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-html/src/srcset.rs:255-262 | crates/op-html/src/srcset.rs:264-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/srcset.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba48a683669ac83ee8a18c651919acfddc18201ecb715ffe7471c3e8165f3f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-image-enrich/src/targets.rs:328-335 | crates/op-orchestrator/src/cleanup_image_slots.rs:63-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/targets.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5557104c24f09f084800111f511a76ebb8b51f7f145ec349c0b41d0d486d2404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-mcp/src/parser.rs:88-95 | crates/op-mcp/src/parser.rs:134-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/parser.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087cb1925963f18ffa7295e5e2bb2945738580e76bc2bf6c2ea14d263456600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-mcp/src/read_tools.rs:294-301 | crates/op-mcp/src/read_tools.rs:337-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/read_tools.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf984ba74755a477938d101d8c52c17a35948dd96e43e8465c723aa8903d38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-orchestrator/src/cleanup_section_margins.rs:250-257 | crates/op-pen-loader/src/layout_scene.rs:592-599 \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":"crates/op-orchestrator/src/cleanup_section_margins.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62fcbd66b2f16300858ad30eaf8771fc0aa978c0f8da9ed3f4c432105bcf4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-orchestrator/src/geometry_row_fixes.rs:349-356 | crates/op-orchestrator/src/geometry_starved_row.rs:146-153 \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":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"390fe5e50c517ac6932975c97dcaf1e36aa3e94e96320c3d811fe9f6852ddb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-orchestrator/src/app_shell_detect.rs:103-116 | crates/op-orchestrator/src/app_shell_restructure.rs:143-150 \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":"crates/op-orchestrator/src/app_shell_detect.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2941ff1b24f75cf8c41b8f040153b7be8982ef6659260fb2a8cfba116d2b427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-pen-loader/src/layout_repair.rs:101-108 | crates/op-pen-loader/src/layout_repair.rs:217-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"209d6ce1e730e21b92b6061a4f36a3ea7b1e6507142a89d185f191d6db941dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-pen-loader/src/widget_payload.rs:38-45 | crates/op-pen-loader/src/widget_payload.rs:58-65 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/widget_payload.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5662681ffd95d05db86d1b7ac3350c9649533a99d9993d327b5225470cc8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-preview-core/src/animation.rs:59-66 | crates/op-preview-core/src/animation.rs:121-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/animation.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3771fbfd19e617f0075410fbee6bb70616802dff85f2313154ce3d0e996cd674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-preview-core/src/device_frame.rs:222-229 | crates/op-preview-core/src/device_frame.rs:234-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/device_frame.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4372e5c3c3981693e145309573823334ca7027ff39ccdd8351e8e6cf25b5a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-render-export/src/pdf.rs:119-126 | crates/op-render-export/src/pdf.rs:157-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-render-export/src/pdf.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"37da50124bd5dc5f6bf23faed5475baf490145a22ef0724905e196d787d6916f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): crates/op-mcp/src/import_common.rs:68-74 | crates/op-mcp/src/write_tools.rs:112-118 | crates/op-mcp/src/write_tools.rs:181-187 | crates/op-mcp/src/write_tools.rs:219-225 | crates/op-mcp/src/write_tools.rs:267-273 | crates/op-mcp/src/write_tools.rs:462-468 | crates/op-mcp/src/write_tools.rs:516-522 | crates/op-mcp/src/write_tools.rs:586-592 | crates/op-mcp/src/write_tools_import_svg.rs:64-70 \u2014 there are 9 copies across 3 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/import_common.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af7b9e4d03491ff012529f0bc177e43857c943d281bb5dd14aa4e0606b8aaee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/op-editor-core/src/property_edit_mutators.rs:501-507 | crates/op-editor-core/src/property_edit_mutators.rs:512-518 | crates/op-editor-core/src/property_edit_mutators.rs:523-529 | crates/op-editor-core/src/property_edit_mutators.rs:534-540 | crates/op-editor-core/src/property_edit_mutators.rs:601-607 \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":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"67029fc319ed7789104c9f8335f0d42873bd42e12fa3074d8373510e63134cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/op-editor-core/src/host_image_panel_transitions.rs:257-263 | crates/op-editor-core/src/host_image_panel_transitions.rs:279-285 | crates/op-editor-core/src/host_image_panel_transitions.rs:304-310 | crates/op-editor-core/src/host_image_panel_transitions.rs:323-329 \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":"crates/op-editor-core/src/host_image_panel_transitions.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"de924fbddd67773ca741bba3d693bcaf1da787bd6796dc16aeefb858ac1f866b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-builtin-model-discovery/src/lib.rs:217-223 | crates/op-host-services/src/hub_auth_client.rs:211-217 | crates/op-host-services/src/web_credentials.rs:151-157 \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":"crates/op-builtin-model-discovery/src/lib.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2456faf9e8eb5a0cf546348c0135c674d7ce372885e99c93752b521f6b49bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-editor-ui/src/widgets/design_md_line_cache.rs:85-91 | crates/op-editor-ui/src/widgets/font_picker_cache.rs:77-83 | crates/op-editor-ui/src/widgets/layer_panel_cache.rs:215-221 \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":"crates/op-editor-ui/src/widgets/design_md_line_cache.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b423fef93ad58400045f46fe5146970048138aa0dac570186f5f973bea493b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-editor-ui/src/widgets/toolbar.rs:205-211 | crates/op-editor-ui/src/widgets/toolbar.rs:249-255 | crates/op-editor-ui/src/widgets/toolbar.rs:346-352 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/toolbar.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a0be8b16babab4afe0ed35b4402d15da905c99dbb344227defa04f045d5552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-host-desktop/src/mcp_integrations.rs:434-440 | crates/op-host-desktop/src/mcp_integrations.rs:443-449 | crates/op-host-desktop/src/mcp_integrations.rs:492-498 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e21988c2861bd67f22be5c00bf4d745d049a705dc702962473f9a8ec72b3207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-host-services/src/chat_spawn.rs:159-165 | crates/op-host-services/src/cli_probe_support.rs:94-104 | crates/op-host-services/src/provider_probe.rs:301-307 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/chat_spawn.rs\u0060 and \u0060crates/op-host-services/src/provider_probe.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_spawn.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e489a33de07d79b20458796ff68721a31f4a6c5aa5c3738eb973add8dc6c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-host-services/src/profile_avatar_fetch.rs:187-193 | crates/op-host-services/src/public_https_client.rs:38-44 | crates/op-host-services/src/public_https_client.rs:62-68 \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":"crates/op-host-services/src/profile_avatar_fetch.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d803f0deec12e6e150009f8459b27b013cfd870ff5182d764c625fa67bfdd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-orchestrator/src/geometry_row_fixes.rs:349-355 | crates/op-orchestrator/src/geometry_row_fixes.rs:495-501 | crates/op-orchestrator/src/geometry_starved_row.rs:146-152 \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":"crates/op-orchestrator/src/geometry_row_fixes.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2b3b7bd0084b4346ec1ff2b133c6165f893edbc867d3779b285158d1940888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-acp/src/client.rs:656-662 | crates/op-collab-relay-client/src/session.rs:35-41 \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":"crates/op-acp/src/client.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ee0bed7462be018dac2479fc7b75f215a09bf54b122dff9c66d8947def31c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-ai-skills/src/budget.rs:187-193 | crates/op-ai-skills/src/budget.rs:239-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/budget.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e86d520e5a934e699b6e97d85bc0f80618980307649d72b3b556af28d27020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-chat-agent/src/design_agent_tools/root_seed.rs:369-375 | crates/op-orchestrator/src/finalize_enforce_status_bar.rs:262-268 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools/root_seed.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c84887bd8284954be3592d3993e5333bf4906bbe885c06ac2f237ef7d35f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-cli/src/command_mappers.rs:199-205 | crates/op-cli/src/command_mappers.rs:316-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/command_mappers.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d074aecb95b97ddf4d270cf1653edd29201a587f33ac9322d7fbd786c58d5d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-codegen/src/codegen_html.rs:41-47 | crates/op-codegen/src/codegen_targets.rs:295-301 \u2014 before extracting anything, compare \u0060crates/op-codegen/src/codegen_html.rs\u0060 and \u0060crates/op-codegen/src/codegen_targets.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"325d6f4c7ab1321203b38b8d162f84de2e6c83c13f5acb96d5c0a63138e98ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-codegen/src/codegen_html.rs:110-116 | crates/op-codegen/src/codegen_targets.rs:359-365 \u2014 before extracting anything, compare \u0060crates/op-codegen/src/codegen_html.rs\u0060 and \u0060crates/op-codegen/src/codegen_targets.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"19566ffb0a5604977021e57aac30ef0a405981d24d91763cb9363d99409ae70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-host/src/runtime/network/guest.rs:218-224 | crates/op-collab-host/src/runtime/network/owner.rs:80-88 \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":"crates/op-collab-host/src/runtime/network/guest.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ca4dbd1a4158f6c65a57c029e483abef5869179ac801675bdb01f9932d97bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-relay-client/src/session.rs:79-85 | crates/op-collab-relay-client/src/session.rs:89-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-client/src/session.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"244cdcec2ca7ace8df7552e8ec6ad9eeacf763f271bd32043cb981cf39c04b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:49-55 | crates/op-collab-smoke/src/fault_guest.rs:184-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b869649095b09d344cf17282ba1e06e1aee1af7ccfd8e52cb75eaf194ba1149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-design-lint/src/node_util.rs:576-582 | crates/op-orchestrator/src/validation_dump.rs:327-333 \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":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd974640251e5e3b0216020c755ec6ece405120c885f07b7d9c38de83be53d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-core/src/instance_override.rs:142-148 | crates/op-editor-core/src/ref_resolve.rs:281-287 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/instance_override.rs\u0060 and \u0060crates/op-editor-core/src/ref_resolve.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6b37f6aeb0fc873333aaed807aa1d1253ff9975a40da21cfc989f8cee9a062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:130-136 | crates/op-editor-core/src/svg_import/path_data.rs:144-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11c6e3595fa5dfba0e4c4d09c200d23a7439d926000e78a34025d15ca8469a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:154-160 | crates/op-editor-core/src/svg_import/path_data.rs:168-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b446e3f2680666f12be2eecfa343818d4a71c014efb4d22906ed515993f23f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-core/src/svg_path_data.rs:233-239 | crates/op-editor-core/src/svg_path_data.rs:244-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9db436676f7b4eb5569f365cc96d764d0154f63c86220b4f8334e83b384154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/export_dialog.rs:305-311 | crates/op-editor-ui/src/widgets/save_name_dialog.rs:68-74 \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":"crates/op-editor-ui/src/widgets/export_dialog.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"60374deaa5a20c5929813203734a74b0767ccefeeaabac46e39135f16675546e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/layer_context_menu.rs:248-254 | crates/op-editor-ui/src/widgets/path_anchor_context_menu.rs:69-75 \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":"crates/op-editor-ui/src/widgets/layer_context_menu.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c8a45cbf196fe1737f6389d6c944e1fe2052788ac60f15e61156c9f1c8ad6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_image/svg_raster.rs:58-64 | crates/op-host-desktop/src/remote_image_host.rs:187-193 \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":"crates/op-editor-ui/src/widgets/canvas_viewport_image/svg_raster.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f4c7f234a3793bba2ec31af368d8d1db64a5fd1902019805676d2d1fe9550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_commit.rs:217-223 | crates/op-editor-ui/src/widgets/property_panel_commit.rs:283-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_commit.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae9ffd816d538dc734486da2125cc6ccceb94954b8b636bbc9368c5d2bfe414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:64-70 | crates/op-orchestrator/src/validation_dump.rs:300-306 \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":"crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f691be4697975916a5552874dcc520599514c646e47fd8e0273882d2ae9203e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-engine-ffi/src/editor.rs:276-282 | crates/op-engine-ffi/src/editor.rs:312-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/editor.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74d0cd27d3ac3b4d92462c88efaede733ddb24b238c5dd4d9d5478e0a8bb403"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-engine-jni/src/bindings_editor.rs:37-43 | crates/op-engine-jni/src/bindings_editor.rs:319-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/bindings_editor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d39ce5042b8f08411e5e9a1805903a041ade566bf3bbd90b9752e5f4e3473db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-git/src/ssh.rs:59-65 | crates/op-git/src/ssh.rs:141-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-git/src/ssh.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cce184de2df51857399241f9d75b2940dae0e453bea50e384e07b6405ea566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-native/src/backend/skia/path.rs:723-729 | crates/op-host-native/src/boolean_ops.rs:181-187 \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":"crates/op-host-native/src/backend/skia/path.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"199223a6a33a0428dfa4bd82314527d49c901e47257619841c52b9048d6a005b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:135-141 | crates/op-host-web/src/widget_host/slides_panel.rs:96-102 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2098ab4cabfa92cac30f06b527c98879b91af827aabf763d7ae3bf3146eb6f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:183-189 | crates/op-host-native/src/widget_host/variables_panel_row_press.rs:218-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"380987813de022a5146b8a6ec5745c9015bf50d7203d546eca7f2f233963d4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-services/src/export_html.rs:117-123 | crates/op-host-services/src/export_hyperframes.rs:344-350 \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":"crates/op-host-services/src/export_html.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7df8b5be889e7f8b4d8d4bf587505fd24912643f38972f3ad6b6a3b4722c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-services/src/mcp_serve/enrich_images_tool.rs:303-309 | crates/op-host-services/src/mcp_serve/finalize_tool.rs:149-155 \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":"crates/op-host-services/src/mcp_serve/enrich_images_tool.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c354a9d46a5af7d5c4663b4b299514e7c7b51e7c488d0136ceadb832f1c30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-web/src/iconify_web.rs:402-408 | crates/op-host-web/src/web_asset_fetch.rs:421-427 \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":"crates/op-host-web/src/iconify_web.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"097497cdb08944f4e8764fd827fcbd8f4eb0dae871673d3d33727e2e191b4f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-web/src/web_chat.rs:164-170 | crates/op-host-web/src/web_design_md.rs:132-138 \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":"crates/op-host-web/src/web_chat.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"67429037f5155f934db813f61f948e76709eefa42982e7467859f989463f5b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:320-326 | crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:388-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":"crates/op-host-web/src/widget_host/keyboard_edit_ops.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f2d57bd4efca593525ab5a8eb65dcb35e9fd95222da8904e5c708d619fb654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-html/src/color.rs:111-117 | crates/op-html/src/color.rs:141-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/color.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99264f45488b1d0665b9e4a2f9cb2186c7b460e762ef3227a99f6381d8a40ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-mcp/src/batch_get.rs:56-62 | crates/op-mcp/src/read_nodes.rs:42-48 \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":"crates/op-mcp/src/batch_get.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"471351a871d8b0bcb6a3522229d0e6307e509e4970e4dbfe43ceabc94138c308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-mcp/src/codegen_plan_store.rs:241-247 | crates/op-mcp/src/codegen_plan_store.rs:338-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009e1ffff2266d064e059e823ba0a594346226aef9bfdd4b4d6a91d51f3acac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-mcp/src/batch_page.rs:8-14 | crates/op-mcp/src/reparent_tools.rs:153-159 \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":"crates/op-mcp/src/batch_page.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c922a5a464510fd0e0a3b16f9974f4c56e6290c5175197dca50a4bd4c6f409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-mcp/src/codegen_plan_store_assembly.rs:79-85 | crates/op-mcp/src/codegen_plan_store_assembly.rs:96-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store_assembly.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8e4f7fc27f092f1327a90c4e0aaf13fc23659c686ea1f6aede4dd1b1ebf9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/category_grid_density.rs:227-233 | crates/op-orchestrator/src/role_post_pass/mobile_cards.rs:46-52 \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":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc58aae385cfb0830f32dba89ed8c470a3037bfcc76e06bf65acb80ca7e6aecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/geometry_card_rail_fixes.rs:59-65 | crates/op-orchestrator/src/geometry_row_fixes.rs:358-364 \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":"crates/op-orchestrator/src/geometry_card_rail_fixes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0153cc44b2bdccc7550ca13a40effa037f76cd55a0b3c6deef86221ac6a053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs:210-215 | crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs:262-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e2ef6b97c62f0b637fe39b79f08ee5c2af2c15a150c45c34f6ef8faa4316e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs:219-225 | crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs:283-289 | crates/op-orchestrator/src/ring_repair.rs:259-261 \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":"crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbce1c3c0c20cd6596ec5004911834eb4b3984ea951abdda4ccc3664c1566b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/text_contrast_repair.rs:106-112 | crates/op-orchestrator/src/text_contrast_repair.rs:659-665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_contrast_repair.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"be674941c5bc0464a0c3992ba54af82d32b2cc99f0b18b1a22889cee873ab924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-pen-loader/src/layout_repair.rs:70-76 | crates/op-pen-loader/src/layout_repair.rs:182-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/layout_repair.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3493d5fdee5b7eb82fef0ff80f9e65a0fbceafafb96ff6f9a2367e3c19d7b86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): crates/op-pen-loader/src/lib.rs:152-158 | crates/op-pen-loader/src/variables.rs:211-215 \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":"crates/op-pen-loader/src/lib.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ab279e21bae50ba7e98b6140d9a362c925d5b91430de69cc619b498d08c270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-util/src/xml_escape.rs:11-17 | crates/op-util/src/xml_escape.rs:26-32 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-util/src/xml_escape.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"19522eaf40cedc2b6e385952a929172231651d98d73512f51430e773481804d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-auth-bridge/src/collab_claims.rs:507-512 | crates/op-collab-transport/src/admission.rs:657-662 | crates/op-collab/src/profile_validation.rs:102-107 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab-transport/src/admission.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d642fb4625836d7e7de6ca2e70fa9aa8b73f7dc40fa0d465968ea451a36ca00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-editor-core/src/instance_override.rs:97-102 | crates/op-editor-core/src/ref_resolve.rs:227-233 | crates/op-editor-core/src/ref_resolve.rs:381-386 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/instance_override.rs\u0060 and \u0060crates/op-editor-core/src/ref_resolve.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23a37b1ed5f5ce9cb82eac5d53f3e88a72f88707e6085c196862c63e85793b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-editor-core/src/property_edit_mutators.rs:764-769 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:115-120 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:128-133 \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":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d452eefc55e8f6b3dc36df5d51ce18a135a8ef27eab2264ef4d3b56c903ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-orchestrator/src/geometry_value_readers.rs:82-87 | crates/op-orchestrator/src/role_layout_post_pass.rs:9-14 | crates/op-orchestrator/src/spacing_repair.rs:277-282 \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":"crates/op-orchestrator/src/geometry_value_readers.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bce03b71a14ed101690150f6601f1a47843ba74fe456bfc3498343316a2461a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-preview-core/src/present.rs:280-285 | crates/op-preview-core/src/session_paint.rs:114-119 | crates/op-preview-core/src/transition.rs:326-331 \u2014 before extracting anything, compare \u0060crates/op-preview-core/src/present.rs\u0060 and \u0060crates/op-preview-core/src/session_paint.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ded32ba34603fd2a5a2b476e2b153b125eb6cebfb48cb7c81cfcc992abdddb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-chat-agent/src/design_agent_diagnostics.rs:167-172 | crates/op-design-lint/src/detectors/spacing.rs:232-237 \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":"crates/op-chat-agent/src/design_agent_diagnostics.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7048e5414b33fafeae283beecaff68966f269f1ce81a719862572933440c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/anthropic.rs:387-392 | crates/op-chat-agent/src/chat_agent_loop/openai.rs:350-355 \u2014 before extracting anything, compare \u0060crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060 and \u0060crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92591d11e88a43dda553853f0261a844c9405bd3f2c2198310e6111ff679c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-chrome-extension-core/src/design_md_validate.rs:110-115 | crates/op-chrome-extension-core/src/design_md_validate.rs:144-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chrome-extension-core/src/design_md_validate.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd8b2af0ffd80b44b4f57e746e538d6d125e05966c3820c4933bc6f0502854f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-collab-relay-locator-hsm/src/server.rs:159-164 | crates/op-collab-relay-locator-hsm/src/server.rs:186-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-hsm/src/server.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb4f8081c283c5d2dd24d43c75f7ff5abd4d69257a95229493f331f07570cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/component_backing.rs:53-58 | crates/op-editor-core/src/component_backing.rs:65-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/component_backing.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f6fea80a195b4499c4dc742dfe8c170e9c64aca7014c4afd084dd56b02e9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/icon_path_normalize.rs:377-382 | crates/op-editor-core/src/icon_path_normalize.rs:388-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"961b23e446e1131176046f2269150b96c3a070bdd1ccf48443a5b72ebf62e3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/icon_path_normalize.rs:389-394 | crates/op-editor-core/src/icon_path_normalize.rs:407-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d11faa001b153a66e7cdf82dab3572d71bc3238261d3efdc98fe66c55ea5036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/icon_path_normalize.rs:396-401 | crates/op-editor-core/src/icon_path_normalize.rs:406-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c79bcbb7f3c743e8c03c8b30e6ab347acc293e0fac3075b2c5b59dc86fd020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/svg_path_data.rs:357-362 | crates/op-editor-core/src/svg_path_data.rs:364-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ac5679d344ca8bc0cb79f43410f63ead3b58faa19c8f8ceba536a4411e8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/fills/access.rs:313-318 | crates/op-editor-core/src/fills/access.rs:334-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5b89a02be946e9e89094cb94e029fc71445405195e21a22f63af007c324098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/command_font_replace.rs:180-185 | crates/op-editor-core/src/hoist_app_state.rs:55-60 \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":"crates/op-editor-core/src/command_font_replace.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b12a091da3db4e41de2deb91e08bddc89e3bf714bd2409d1f3f621b3768bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/collab_avatar_runtime.rs:470-475 | crates/op-editor-ui/src/collab_avatar_runtime.rs:491-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/collab_avatar_runtime.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c998469db7a018baa2d4543d2b72a91d7071ef71e32759eaf37109660ee6d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:201-209 | crates/op-editor-ui/src/widgets/agent_settings_builtin.rs:291-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f88a793ca42ded4343f8f19f5ff8193d429b419b7ee173626d1318b8253000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs:310-315 | crates/op-editor-ui/src/widgets/missing_fonts_flow.rs:108-113 \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":"crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"759440eb9863ec4d49169a29d2280295b23e3148a6b1dc5c86d57ea2f9aa455a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_palette.rs:128-133 | crates/op-editor-ui/src/widgets/home_surface_palette.rs:174-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_palette.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0b672d6fccad8c91bc02a184d24e0684cdf49eb4fc19a6e0d3cbd18761a625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/preview_device_switcher.rs:57-62 | crates/op-editor-ui/src/widgets/screen_switcher_pills.rs:81-86 \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":"crates/op-editor-ui/src/widgets/preview_device_switcher.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e0939d3abc7eb522c1c05b453f1ad79c37cb6f0ef40240cc8170e9b1006e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/text_input.rs:105-110 | crates/op-editor-ui/src/widgets/text_input.rs:167-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/text_input.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d4f6c5a9d79f212108e830adf63e1ee03c14b63ca2841d886af1f73680db0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs:329-334 | crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs:351-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef14ec5a084da124a67dbed9cdb8b7a5421f5e4ae2485b89403e119f26c6562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_layout_ops.rs:230-235 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:215-220 \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":"crates/op-editor-ui/src/widgets/property_panel_layout_ops.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"800276e6d91db163a6b0e28c6d39c882fd5edfc575f11528f3f51cec18c998b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_path_overlay.rs:183-188 | crates/op-editor-ui/src/widgets/canvas_viewport/overlays.rs:72-77 \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":"crates/op-editor-ui/src/widgets/canvas_path_overlay.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89bc3a532a27002313ce0a3d8c9f1689bb310ef3fc9546e71086428169c44d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-engine-jni/src/callbacks.rs:200-205 | crates/op-engine-napi/src/callbacks.rs:143-151 \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":"crates/op-engine-jni/src/callbacks.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9336f080cf1694d8913f6b5851ba9c5b0e236b9481108b9ea6adb7edf821a01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/op-figma/src/instance.rs:413-417 | crates/op-figma/src/instance/assignment.rs:28-33 \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":"crates/op-figma/src/instance.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf455d492fe01351ea5a77e93b5ed9c7808246f3c0893362bf1ac7605b7f6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-figma/src/instance/swap_filter.rs:36-41 | crates/op-figma/src/instance/swap_filter.rs:42-47 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/swap_filter.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a188695aa7b934c8dea5a1d4efa457fa297883acfd5b222093de35659163ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-git/src/merge.rs:136-141 | crates/op-git/src/merge.rs:518-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-git/src/merge.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c4be9095a9b04c7f3737efc356395e0a26d9c8449045ed9ea1d928df411cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-desktop/src/iconify_host.rs:152-157 | crates/op-host-desktop/src/remote_image_host.rs:128-133 \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":"crates/op-host-desktop/src/iconify_host.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74bc53401dfb303ab3b9e2c565e39cbfe9220e6577e79fda101de40f5826afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/connection.rs:173-178 | crates/op-host-services/src/web_canvas_server/online_run_loop.rs:686-691 \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":"crates/op-host-services/src/web_canvas_server/connection.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"462cd2b87473931dbf298753ab2da4c143748cbb8d412a2f36b12ea75f86c752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-services/src/web_static.rs:68-73 | crates/op-host-services/src/web_static.rs:104-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_static.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d281bf8c37b0fff17e54c2c3a7b6871df27a936012ae42efb0cf143378a5ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-web/src/vscode_bridge.rs:622-627 | crates/op-host-web/src/vscode_bridge.rs:690-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/vscode_bridge.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd79b5c1d7a9acaf3dc6c389d7215fb6ec9943d275c1bd20a12aef44fd48432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-image-enrich/src/net/fetch.rs:251-256 | crates/op-image-enrich/src/net/fetch.rs:521-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/fetch.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6991632451ceaf80b3931c9ddf10f85fe07c38a22cbf949220668f4c08cb11d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-mcp/src/batch_design_result.rs:233-238 | crates/op-mcp/src/design_refine_result.rs:72-77 \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":"crates/op-mcp/src/batch_design_result.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac83af009533a53a9f96ff06bdacce430d81e4f497d12e01817c7bf906306c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-mcp/src/open_document.rs:63-68 | crates/op-mcp/src/open_document.rs:113-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":"crates/op-mcp/src/open_document.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea92543b83b172d5f79f01a5f5ee3db80c8edcbe884dc628363992bf1d7f0f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-mcp/src/page_tools.rs:342-347 | crates/op-mcp/src/page_tools.rs:392-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/page_tools.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"120a61feeead3bd91a9343887e753e96102fa988388cf2ac7e7b282922be07ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/op-orchestrator/src/avatar_repair.rs:194-198 | crates/op-orchestrator/src/cleanup_root_and_nav.rs:168-173 \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":"crates/op-orchestrator/src/avatar_repair.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a589347b39653969d1d9967705ef98157dd9dfb042728de204cff8c453b8233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/geometry_scale_ops.rs:87-92 | crates/op-orchestrator/src/geometry_validation.rs:434-439 \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":"crates/op-orchestrator/src/geometry_scale_ops.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1dd54f03decdc091bfe8916cb263f77a20727df8d6cffb9f4dbff147f41e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/orchestration_self_check.rs:356-361 | crates/op-orchestrator/src/role_post_pass/mobile_cards.rs:102-107 \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":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d092057fdd466afc323037de6528f1cc644c9e9435123ea4fae507984378aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/radial_repair.rs:191-196 | crates/op-orchestrator/src/ring_repair.rs:108-113 \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":"crates/op-orchestrator/src/radial_repair.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec83fad39a43645d7be86d84c2d1fb9c16d6a1bfea5d41780c4eea657b5525b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:168-171 | crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:205-208 | crates/op-orchestrator/src/validation_dump.rs:276-281 | crates/op-orchestrator/src/validation_fixes_apply.rs:568-573 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/validation_dump.rs\u0060 and \u0060crates/op-orchestrator/src/validation_fixes_apply.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4709943e5cd395876450ffb9ea4c77039cd6c5d991049e9125d2c5185c7c5b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:193-196 | crates/op-html/src/mapper_node_access.rs:99-102 | crates/op-orchestrator/src/validation_dump.rs:292-297 | crates/op-orchestrator/src/validation_fixes_apply.rs:587-592 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/validation_dump.rs\u0060 and \u0060crates/op-orchestrator/src/validation_fixes_apply.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceb873ada4d220de1c77db3480e17983a4f89f5504c9d2fff610ff0006c5f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/geometry_diagnostics_collect.rs:211-216 | crates/op-orchestrator/src/geometry_overflow_fixes.rs:75-80 \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":"crates/op-orchestrator/src/geometry_diagnostics_collect.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"359e6ea694075feb9302229a4e8dc78e32ddda115a06b48d3ee74448263d5703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/role_post_pass/layout_props.rs:14-19 | crates/op-orchestrator/src/role_post_pass/layout_props.rs:160-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/layout_props.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a34da844d0fd553e81f6a83c25a5e79eb3d03253aa60b5c2b2542f6c4a7433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-pen-loader/src/widget_payload.rs:131-136 | crates/op-pen-loader/src/widget_payload.rs:170-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/widget_payload.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b69e87bf5dd3411706fae0bd12e5852c9884f5874fc1ab6cab69d08ce106c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-process-io/src/process_tree.rs:329-334 | crates/op-process-io/src/process_tree.rs:433-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-process-io/src/process_tree.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dadc1df3e0715c006c78168b619e55bb6ed0db99d12956d43564a1998de218c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): crates/op-mcp/src/reparent_tools.rs:78-82 | crates/op-mcp/src/write_tools.rs:116-120 | crates/op-mcp/src/write_tools.rs:223-227 | crates/op-mcp/src/write_tools.rs:466-470 | crates/op-mcp/src/write_tools.rs:520-524 | crates/op-mcp/src/write_tools.rs:590-594 | crates/op-mcp/src/write_tools_import_svg.rs:68-72 \u2014 there are 7 copies across 3 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/reparent_tools.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cf1a7621e46ed9dc70a7e75f397c01921040f3377d7e622807363447880edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/op-editor-core/src/svg_import/path_data.rs:124-128 | crates/op-editor-core/src/svg_import/path_data.rs:148-152 | crates/op-editor-core/src/svg_path_data.rs:126-130 | crates/op-editor-core/src/svg_path_data.rs:134-138 | crates/op-editor-core/src/svg_path_data.rs:141-145 | crates/op-editor-core/src/svg_path_data.rs:146-151 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/svg_import/path_data.rs\u0060 and \u0060crates/op-editor-core/src/svg_path_data.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c560e1f232f3941b301f4427fa761e45aececfca62ca6de23fba6499765ca8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/op-codegen/src/lib.rs:270-274 | crates/op-design-lint/src/node_util.rs:431-435 | crates/op-editor-core/src/fills/access.rs:30-34 | crates/op-mcp/src/style_ops_tools.rs:450-454 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa995655d93d308ac22f49c39e5ff820d433b007986451d40fe29b93a88f7b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-design-lint/src/node_util.rs:457-461 | crates/op-editor-core/src/fills/access.rs:107-111 | crates/op-mcp/src/style_ops_tools.rs:474-478 \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":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d990c37575eea94bdab2912e922517e7bc4a0455e3f3418465dec4eee35352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-design-lint/src/detectors/structure.rs:306-310 | crates/op-orchestrator/src/avatar_repair.rs:194-198 | crates/op-orchestrator/src/cleanup_root_and_nav.rs:168-172 \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":"crates/op-design-lint/src/detectors/structure.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"47858f6013a05f16a72fd96585acb78a8f41254337500631ac0c3ba5fc40c516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-editor-core/src/svg_path_data.rs:348-352 | crates/op-editor-core/src/svg_path_data.rs:357-361 | crates/op-editor-core/src/svg_path_data.rs:364-368 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_path_data.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"913de868f9c24f14e43f834fc894ba0aca096ca664268770fbcbadfe658afe1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-editor-ui/src/widgets/layer_context_menu.rs:248-252 | crates/op-editor-ui/src/widgets/layer_context_menu.rs:285-289 | crates/op-editor-ui/src/widgets/path_anchor_context_menu.rs:69-73 \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":"crates/op-editor-ui/src/widgets/layer_context_menu.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e294bfce50b263217faa1048b6ef346a0619b5253073db22b65c819536f313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-host-services/src/design_md_llm.rs:76-80 | crates/op-orchestrator/src/design_system.rs:385-389 | crates/op-orchestrator/src/run.rs:295-299 \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":"crates/op-host-services/src/design_md_llm.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"778b29cdce9423a658b26851472a4f308c8c1513fdee0950f25c931b0a15198c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-acp/src/client.rs:117-121 | crates/op-acp/src/client.rs:698-702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-acp/src/client.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca35d66a36e490c42e59b93ceb249898a6946971e7f2e67433d835377898607b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-chat-agent/src/chat_agent_context.rs:138-142 | crates/op-image-enrich/src/net/downscale.rs:189-193 | crates/op-image-enrich/src/net/downscale.rs:235-239 \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":"crates/op-chat-agent/src/chat_agent_context.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"088d1d40cfbf4a36a773448580d457e95ccede02b030fe0236e5c38487dc9db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop.rs:407-411 | crates/op-host-services/src/chat_builtin_http_wire.rs:44-48 \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":"crates/op-chat-agent/src/chat_agent_loop.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"322938ef603bcb89bb1b5d12133ea62b76c059b441a11835a00a8518faa25e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-chat-agent/src/chat_agent_loop/openai.rs:58-62 | crates/op-engine-ffi/src/editor_chat_turn.rs:142-146 \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":"crates/op-chat-agent/src/chat_agent_loop/openai.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21ce24e4c64edd3d5d61735eb6ba4a9cca3e76a9797904544a80ebe4a7518d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-collab/src/apply_tree.rs:345-349 | crates/op-orchestrator/src/validation_dump.rs:188-192 \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":"crates/op-collab/src/apply_tree.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd328e734e4488558fc78f3a0ea69fc175aebd6ea0fc96a96943d42bf974c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-collab-relay-server/src/server.rs:135-139 | crates/op-host-services/src/mcp_live/connection.rs:59-63 \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":"crates/op-collab-relay-server/src/server.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9e3bf2842ac6206f31c66bf15c0e67e5fab2b5d28648790e73eae7bc8b5271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-design-lint/src/detectors/spacing.rs:82-86 | crates/op-design-lint/src/detectors/spacing.rs:90-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a08487b7806617df72dc66b635592c7cd6cc68e1e67fdf078d77bb69a5d8d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-design-lint/src/node_mut.rs:162-166 | crates/op-figma/src/layout_positioning.rs:106-110 \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":"crates/op-design-lint/src/node_mut.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b733ccc7c264713c3de1102ee2acc0458c9dd3583cd3675d4e0466ad19a141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/op-editor-core/src/command_style_replace.rs:434-438 | crates/op-editor-core/src/fills/access.rs:175-179 | crates/op-orchestrator/src/variable_binding.rs:298-301 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/fills/access.rs\u0060 and \u0060crates/op-orchestrator/src/variable_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76df85ceacf674228891b8beca5264ac1d8addfc8ee239c37883f703f4fd9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/icon_path_normalize.rs:371-375 | crates/op-editor-core/src/icon_path_normalize.rs:391-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":"crates/op-editor-core/src/icon_path_normalize.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ae688138ce9b78afe9d7afd2f814ced4bf27149ec29c33a691fabb1ce48c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/conversion.rs:91-95 | crates/op-editor-core/src/conversion.rs:161-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/conversion.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a77c365424c78ef047e7f4ec6d088ab72802546cbac4046dbb29e792954403a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/op-editor-core/src/command_node_attrs/slots.rs:129-133 | crates/op-editor-core/src/fills/access.rs:82-86 | crates/op-orchestrator/src/variable_binding.rs:323-325 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/fills/access.rs\u0060 and \u0060crates/op-orchestrator/src/variable_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node_attrs/slots.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7addc0c4eaa2d81eec77092c5ce39f03dc0a369794d3b65af921446b8851ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/property_edit_mutators.rs:557-561 | crates/op-editor-core/src/property_edit_mutators.rs:582-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e717fbba0b4e4f6791a3558cfb4bc03566bf7278bbe5aee2e471f3b73e18ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/color_picker.rs:479-483 | crates/op-editor-core/src/color_picker.rs:485-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/color_picker.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e8da4c81c55b2f1abed6ba3fab5cf2418a8f36c193a65ea82f854bcb6f1c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/path_bounds.rs:47-51 | crates/op-editor-core/src/path_bounds.rs:53-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/path_bounds.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7777e1c8e3a4e51c068edcc0a6f8105104af42826fd7d97473fbf30d391464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/scene_bounds.rs:75-79 | crates/op-editor-ui/src/svg_export/transform.rs:168-172 \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":"crates/op-editor-ui/src/scene_bounds.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c5a244cc3ebfda7c734927f93e8e395623aac4e56cbf0327813850f0570a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_account.rs:282-286 | crates/op-editor-ui/src/widgets/login_modal.rs:170-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_account.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"da073a05046e9f4ca9cdca4929f0b46dbfb840744c252b464a652bfefd990e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_acp.rs:551-555 | crates/op-editor-ui/src/widgets/agent_settings_press_focus.rs:119-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67b5a08467406e22c2be614c295a0993392fd6df3804cf1f70c54bd80f2ceb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_collab_presence.rs:145-149 | crates/op-editor-ui/src/widgets/collab_avatar_paint.rs:93-97 \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":"crates/op-editor-ui/src/widgets/canvas_collab_presence.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8e6b366452c02294d430344c8ea8339ba01b86ad5dd24065ae439d901c3f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_palette.rs:90-94 | crates/op-editor-ui/src/widgets/home_surface_palette.rs:136-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_palette.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c35aaaa3d36199269d618a63cea34489401fd1e16aeaf1078112240738f0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel.rs:424-428 | crates/op-editor-ui/src/widgets/property_panel.rs:471-475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"018ca659bc2cd344dd6d5a4c969692d459c1be2544257b98cd25b97a1d8254cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/op-editor-ui/src/widgets/ai_chat_mcp_notice.rs:87-91 | crates/op-editor-ui/src/widgets/panel_control_metrics.rs:116-119 | crates/op-preview-core/src/mode_transition.rs:186-190 \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":"crates/op-editor-ui/src/widgets/ai_chat_mcp_notice.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"867931122dcaaf6c97130dcd9285f17a9ca736d77dfbbab0ef76c0deb79933d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:178-182 | crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:215-219 \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":"crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b1011e695fe6258e0cb1a2358189e9af56d9de952543cf01c6e8840a2192e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/missing_fonts_flow.rs:58-62 | crates/op-host-native/src/widget_host/font_picker_dispatch.rs:402-406 \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":"crates/op-editor-ui/src/widgets/missing_fonts_flow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89dd7176bb99ac34d49ff1aca38241d15e860702fa4508815834711c6064627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat.rs:372-376 | crates/op-host-desktop/src/chat_session.rs:291-295 \u2014 before extracting anything, compare \u0060crates/op-engine-ffi/src/editor_chat.rs\u0060 and \u0060crates/op-host-desktop/src/chat_session.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da815948cdf861d647ddccf4b1b27a6d23a70420d731fdad4ab7796eb83cce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-engine-jni/src/callbacks.rs:104-111 | crates/op-engine-jni/src/callbacks.rs:133-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/callbacks.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"21533ffc5ec11518ae3fbb303ed1986f3d422db9d2355bf70d7f2a1038bf5cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-figma/src/node_mapper.rs:116-120 | crates/op-figma/src/node_mapper.rs:282-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/node_mapper.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"971e71303f60b7c6b4f0381255489e4ac70578d75abdbe8344a17d58bc36c247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-figma/src/instance.rs:210-214 | crates/op-figma/src/instance.rs:641-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b031a0b2f40f5173488487f5760fd261d4a76189015938a6c726e21c1630e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-host-desktop/src/chat_session_launch_design.rs:205-210 | crates/op-host-desktop/src/chat_session_launch_providers.rs:109-113 \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":"crates/op-host-desktop/src/chat_session_launch_design.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad62756295e7285cb9432148c5716ec43c4dcc0785b54be90555ce1f555eed1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-host-services/src/mcp_live/connection.rs:62-66 | crates/op-host-services/src/web_canvas_server/online_run_loop.rs:236-240 \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":"crates/op-host-services/src/mcp_live/connection.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3e4a0fda906048c741a89d4a6a1eef9bebe123aba745c1bfad4b0174c1d851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:176-180 | crates/op-host-services/src/web_canvas_server/run_loop.rs:59-63 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/web_canvas_server/online_run_loop.rs\u0060 and \u0060crates/op-host-services/src/web_canvas_server/run_loop.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c90ecc406a9a6d82ea94057c4d655853eddae1d33b2c8f86661d7a97f1e947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-html/src/color.rs:188-192 | crates/op-html/src/color.rs:199-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/color.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4744a364bf0a57b13e94c45ec114f70bf4a71253a24ded329060bce165789456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-html/src/color.rs:210-214 | crates/op-html/src/color.rs:221-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/color.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6f85a8b90f3586475797a0bab95787218ff05478198ee0d33e36018ff1ec21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-image-enrich/src/net/downscale.rs:92-96 | crates/op-image-enrich/src/net/downscale.rs:126-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/downscale.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"726e850f900cf6a548edcf3019d19d3fe3486e1399b1ded2d01e06f90d2f8198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/cleanup_container_geometry.rs:195-199 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:217-221 \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":"crates/op-orchestrator/src/cleanup_container_geometry.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1930f01170936fc5a175e665c61b556ba28c5ad08d06ad9935406ad2509430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/cleanup_equalize_siblings.rs:309-313 | crates/op-orchestrator/src/cleanup_equalize_siblings.rs:325-329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"71670bfb94782d1b9e1f5a3e7e936dcfa4e235cd8a9f0a80c009db2b8b05caf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/finalize_enforce_status_bar.rs:183-187 | crates/op-orchestrator/src/finalize_enforce_status_bar.rs:247-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/finalize_enforce_status_bar.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"782fae8f759786274dbcea3ecc5534e8e31a3a687de59ccb26895ac4e455ecd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/geometry_overflow_fixes.rs:241-245 | crates/op-orchestrator/src/geometry_overflow_fixes.rs:255-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe6f6d965eeef1e5f817148925adce743b1ea0b9354ce3d589932d73734d20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): crates/op-editor-core/src/fills/access.rs:183-206 | crates/op-html/src/mapper_node_access.rs:62-85 | crates/op-orchestrator/src/variable_binding.rs:332-355 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/fills/access.rs\u0060 and \u0060crates/op-orchestrator/src/variable_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"126550a1c9e7c00ceb4a92340c9fac040291294687edd297a9f81c2e958a9ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/op-editor-core/src/hoist_app_state.rs:21-45 | crates/op-preview-core/src/binding_sites.rs:27-51 \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":"crates/op-editor-core/src/hoist_app_state.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c5d9be5e2ba1bc9ebe6c8682d0128adabd4ad8e269f6ed8a6c347711b38513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/op-pen-loader/src/adapter/geometry.rs:72-91 | crates/op-pen-loader/src/layout_repair.rs:691-710 \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":"crates/op-pen-loader/src/adapter/geometry.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d044144e5ef386bff2fcae180b1d74a0f01e7e0e65afe0cf9cb8d2406a413e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-ai/src/agent_settings_state.rs:79-89 | crates/op-editor-core/src/chat/models.rs:63-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai/src/agent_settings_state.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4aeb7a5d65b55ce5ef52e1ecffd4016592f1f59dc31f5dc3ee02dd43cc01ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-ai/src/agent_settings_state.rs:95-105 | crates/op-editor-core/src/chat/models.rs:76-86 \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":"crates/op-ai/src/agent_settings_state.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f413c15390c636122d71cef71b8b99ece2cb5da28b2bf59c86fe5b7e6038f893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/op-auth-bridge/prebuilt_provenance.rs:490-497 | crates/op-cli/src/html_cli.rs:254-261 | crates/op-host-desktop/src/html_import_session.rs:208-215 | crates/op-html/src/resources_image_metadata.rs:167-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/prebuilt_provenance.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82d47c6a9b5f9346c9084d08f45aba2775da6cd11384480ee9ed323ecf29228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-auth-bridge/src/collab_claims.rs:446-452 | crates/op-collab-transport/src/admission.rs:610-616 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab-transport/src/admission.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eadf47cd60c96e581a3862b26349db0dc7c54992388cdd995bbeb0f54e75255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-auth-bridge/src/collab_claims.rs:531-535 | crates/op-collab-transport/src/admission.rs:700-704 | crates/op-collab/src/profile_validation.rs:126-130 \u2014 before extracting anything, compare \u0060crates/op-auth-bridge/src/collab_claims.rs\u0060 and \u0060crates/op-collab-transport/src/admission.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ff3bdd13225e9c6ae69b5665b2037db51caa4145d28565e680d14299faf4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-auth-bridge/src/collab_union_policy.rs:498-504 | crates/op-collab-host/src/runtime/relay_bootstrap.rs:621-627 \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":"crates/op-auth-bridge/src/collab_union_policy.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc283b3378418e60be57e13cf2ed71b60c46f4aa6344b8a0568df51b438a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 14): crates/op-chat-agent/src/design_agent_diagnostics.rs:449-456 | crates/op-editor-core/src/uikit_io.rs:309-316 | crates/op-mcp/src/batch_program_exec_ops.rs:425-432 | crates/op-mcp/src/style_ops_tools.rs:480-487 | crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:176-183 | crates/op-orchestrator/src/cleanup_equalize_siblings.rs:498-505 | crates/op-orchestrator/src/cleanup_layout.rs:81-88 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:249-256 | crates/op-orchestrator/src/cleanup_root_and_nav.rs:222-229 | crates/op-orchestrator/src/cleanup_section_margins.rs:272-279 | crates/op-orchestrator/src/cleanup_slide_padding.rs:412-419 | crates/op-orchestrator/src/mobile_content_rail_detect.rs:271-278 | crates/op-orchestrator/src/mobile_reflow.rs:328-335 | crates/op-pen-loader/src/layout_repair.rs:742-749 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/cleanup_section_margins.rs\u0060 and \u0060crates/op-orchestrator/src/cleanup_slide_padding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_diagnostics.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bd58fc732d76805eaab833bf432db30386cf94a59f309d4cc7a7e1c71862d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-chat-agent/src/design_agent_tools/quality_scans.rs:562-567 | crates/op-host-desktop/src/design_loop_indicator.rs:310-315 | crates/op-orchestrator/src/subagent.rs:459-464 \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":"crates/op-chat-agent/src/design_agent_tools/quality_scans.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee02a5780ffba24cd8bb8eaf58c3051b47c6ce82e361061fb8f9d3fcb14e881e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-chat-agent/src/design_agent_tools/root_seed.rs:192-198 | crates/op-editor-core/src/tests_mutators/support.rs:14-19 | crates/op-host-services/src/mcp_serve/finalize_tool.rs:189-195 \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":"crates/op-chat-agent/src/design_agent_tools/root_seed.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abde2e1d0d381a32a90481a415f23f718a79407b34397544fb27f6e31ab0312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/op-chat-agent/src/chat_canvas_tools.rs:417-424 | crates/op-editor-ui/src/widgets/drag_flow_index.rs:223-230 | crates/op-host-services/src/mcp_serve/enrich_images_tool.rs:452-459 | crates/op-orchestrator/src/card_inner_padding.rs:312-319 | crates/op-orchestrator/src/touch_target_floor.rs:265-272 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_canvas_tools.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd742d5f3c39d9597e3bf8c34dc6e9b8ec456c16c1f323bcf0f9c48afbadcd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-chat-agent/src/backoff.rs:161-166 | crates/op-host-services/src/web_canvas_server/tenant.rs:731-736 | crates/op-host-web/src/listener.rs:74-79 \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":"crates/op-chat-agent/src/backoff.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3684bb08c4619494d8c3946c3c02220b6394543e30cb9ec3e59235fded38b68c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/op-chrome-extension-core/src/design_md_palette.rs:141-161 | crates/op-chrome-extension-core/src/design_md_render.rs:282-302 \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":"crates/op-chrome-extension-core/src/design_md_palette.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b6a89e12d43b3edf32bc3a48af7bbe81834f15cc91e98436ffca3a3f117527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-cli/src/app_control_cli.rs:602-609 | crates/op-host-services/src/mcp_live/ui_requests.rs:149-156 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/app_control_cli.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e505be769bb7ae9a22734a3b923bffac7fb2bb85d468d72f5c0bf8d545c825a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-cli/src/mcp_http_cli.rs:47-52 | crates/op-mcp/src/codegen_plan_store.rs:81-86 \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":"crates/op-cli/src/mcp_http_cli.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"64afb73c603cc0ad1176679208d67ef665a285ebdcb4b3a6e7b6a5f4ac365389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-codegen/src/lib.rs:398-408 | crates/op-mcp/src/element_tools.rs:21-31 \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":"crates/op-codegen/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b988c6c74d89cadae122b27574d5e75a6076b76ead6c26d4133a2b32c45efb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-codegen/src/ai/parse.rs:64-71 | crates/op-mcp/src/codegen_plan_store.rs:384-391 \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":"crates/op-codegen/src/ai/parse.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"39464d5e05aebb0c9b25545157b7c17e02b4b29538bcebc83145b2a881f0cc0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-collab/src/diff_index.rs:17-22 | crates/op-collab/src/undo_ledger.rs:42-47 \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":"crates/op-collab/src/diff_index.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"885fd838635a89b355b05414bf7d1c7fdeb777b7f521c98e99235011bee55e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/op-collab-relay-control-plane/src/http_client.rs:217-226 | crates/op-collab-relay-control-plane/src/issuer.rs:150-159 | crates/op-collab-relay-control-plane/src/publish.rs:393-402 \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":"crates/op-collab-relay-control-plane/src/http_client.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"430fe8d3ea50a1a9da018c3e508bb206d9d24716ba1597184eb43ba3e800f597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-relay-control-plane/src/service.rs:186-192 | crates/op-collab-relay-locator-server/src/http.rs:585-591 \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":"crates/op-collab-relay-control-plane/src/service.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"673a029916991710b8b598fc592a2db0916969ee5ac45c66794f4131851c808c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-collab-relay-protocol/src/invite.rs:145-152 | crates/op-collab-relay-protocol/src/locator.rs:543-550 \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":"crates/op-collab-relay-protocol/src/invite.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0943e574d4249f8b9218085ff886084d9be8796d1dcda685695fa9d6a40c9c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-smoke/src/guest.rs:149-155 | crates/op-collab-smoke/src/owner.rs:283-289 \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":"crates/op-collab-smoke/src/guest.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42da74d894ba0bf95fd85998e0c0f3bda8cb2ea710d3551a75c8dc1c8c3f954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-transport/src/queue.rs:362-368 | crates/op-collab-transport/src/reassembly_budget.rs:102-108 \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":"crates/op-collab-transport/src/queue.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2222381280d7cdd99f21abbd1b83814527f1ea13437ede9b0893341f0e3d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-design-lint/src/node_util.rs:170-175 | crates/op-orchestrator/src/mobile_reflow.rs:350-355 \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":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37db805f7e9b0ab180f9c1d8e6315c98a20b5fedeb5f727d91693c6b5fad3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-design-lint/src/fixes.rs:156-161 | crates/op-design-lint/src/plan.rs:194-199 \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":"crates/op-design-lint/src/fixes.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0323ab6ed05b1a8282495426b6c6ec7c46a089e4dcf963ed90580139cb041d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-design-lint/src/fixes.rs:192-199 | crates/op-design-lint/src/plan.rs:208-215 \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":"crates/op-design-lint/src/fixes.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e87cc35e6af11fee1b5ccca27f9a6d2b5d1029581fe4df77df65358baa95acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-core/src/chat.rs:99-105 | crates/op-editor-core/src/codegen.rs:112-118 \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":"crates/op-editor-core/src/chat.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e10e0a924664688c69df877fb3d91a561ca0a3baef3ff444da15f25aca40a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-core/src/command_style_replace.rs:464-471 | crates/op-editor-core/src/variables_resolve/replace.rs:167-174 \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":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ace87b41b4c6012e61f47c492e4e0a223a0355dafb6014b615ba3fe4f6507c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/editor_toast.rs:75-80 | crates/op-editor-core/src/html_import_diagnostics.rs:44-49 \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":"crates/op-editor-core/src/editor_toast.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e6e4c343461dccea36c07d0049f7ae795386912c90b4bfebc522426ba32ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-core/src/property_panel_state.rs:202-210 | crates/op-editor-ui/src/widgets/export_dialog.rs:42-50 \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":"crates/op-editor-core/src/property_panel_state.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccdc2b962de7909e8ae61a7dd968b6f104345293d91908e5972001c76fbb311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-core/src/property_panel_state.rs:212-220 | crates/op-editor-ui/src/widgets/export_dialog.rs:51-59 \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":"crates/op-editor-core/src/property_panel_state.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7450c8512c4fc29856f39b1b553509b7a7496a9b6f3e622ad787a57c01dd208b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-core/src/svg_import/path_data.rs:204-211 | crates/op-editor-core/src/svg_path_data.rs:295-302 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/svg_import/path_data.rs\u0060 and \u0060crates/op-editor-core/src/svg_path_data.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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":"crates/op-editor-core/src/svg_import/path_data.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e1048238d4045c8215388335c16c24e958a4f58d90b5cdd0c78e784648710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-editor-core/src/svg_import.rs:73-78 | crates/op-editor-core/src/svg_import.rs:120-125 | crates/op-html/src/dom.rs:34-39 \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":"crates/op-editor-core/src/svg_import.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b45f0f0790d7143d96f7700397dc9db8d5980d10bc46cccc34da28e58b2ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-core/src/theme_presets.rs:89-99 | crates/op-host-desktop/src/render_cli.rs:137-147 \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":"crates/op-editor-core/src/theme_presets.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bd5d8ae6c11b52a6d35d1c7a0904d6c07e7f241046cfa9555ef374487b5b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-core/src/host_preset_name_draft.rs:122-128 | crates/op-editor-ui/src/widgets/variables_preset_menu.rs:410-416 \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":"crates/op-editor-core/src/host_preset_name_draft.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35997a0673efb3ba835f6d66019c45aca6392bde58b4fccddc1affedf5e47a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-core/src/command_apply/helpers.rs:54-62 | crates/op-pen-loader/src/variables.rs:110-118 \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":"crates/op-editor-core/src/command_apply/helpers.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dd27e0a111cff4f3073e895a1a713178b585e893ab491c6d7bab94e09eeb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-host-core/src/codegen_runtime_state.rs:62-70 | crates/op-host-web/src/codegen_web.rs:165-173 \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":"crates/op-editor-host-core/src/codegen_runtime_state.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d05b79573c4db21d25e01c697c4658cba5e40828df0f790d7a44eb64b874d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/svg_export.rs:261-267 | crates/op-render-export/src/lib.rs:338-344 \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":"crates/op-editor-ui/src/svg_export.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"af672d1bd3e1c5e35626560a140b5225282bc880a11066c25756e85d913ab068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/theme.rs:24-31 | crates/op-editor-ui/src/widgets/property_panel_code_complete.rs:645-652 \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":"crates/op-editor-ui/src/theme.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6401b17e72afd44fb693b94ffbb8dc9256781e9f8da2a358530dbdc3ef484f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-editor-ui/src/widgets/account_menu.rs:132-139 | crates/op-editor-ui/src/widgets/export_quick_menu.rs:144-151 | crates/op-editor-ui/src/widgets/file_menu_paint.rs:37-44 \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":"crates/op-editor-ui/src/widgets/account_menu.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ba564f309aeee19c8b10aeb5c0b60720d8a7e20c916cf2fb07cf8a25d627e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_acp.rs:725-733 | crates/op-editor-ui/src/widgets/agent_settings_builtin_layout.rs:230-238 \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":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7978d3276438b56ce9a91a30d78337497ecfbd825dba2a0551bfb1a134f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10): crates/op-editor-ui/src/widgets/agent_settings_builtin_parts.rs:484-493 | crates/op-editor-ui/src/widgets/agent_settings_form_actions.rs:164-173 | crates/op-editor-ui/src/widgets/ai_chat_panel_controls.rs:128-137 | crates/op-editor-ui/src/widgets/ai_chat_transcript.rs:565-574 | crates/op-editor-ui/src/widgets/ai_chat_transcript_tools.rs:529-538 | crates/op-editor-ui/src/widgets/component_browser_panel.rs:723-732 | crates/op-editor-ui/src/widgets/property_panel_code_generating.rs:300-309 | crates/op-editor-ui/src/widgets/property_panel_image_fill.rs:641-650 | crates/op-editor-ui/src/widgets/settings_form.rs:24-33 | crates/op-editor-ui/src/widgets/variables_preset_menu.rs:399-408 \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 10 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin_parts.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d773e562010a61988f4bbfa5d71b392809f3e484cb3fec729e25747cf55560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_collab_presence.rs:104-109 | crates/op-editor-ui/src/widgets/canvas_path_overlay.rs:151-156 \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":"crates/op-editor-ui/src/widgets/canvas_collab_presence.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d26c22ade056cb350c8747c522cf6a02ffd8445abfac77869da55304a198cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_layout_transition.rs:54-59 | crates/op-preview-core/src/transition.rs:183-188 \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":"crates/op-editor-ui/src/widgets/canvas_layout_transition.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0011c777e7043e835cb98cb5a905c5624bad3505c379eee526845204943f8fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/component_browser_panel.rs:327-333 | crates/op-editor-ui/src/widgets/icon_picker_panel.rs:164-170 \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":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9aa08761d21db1a15078f6aa657519e5196bef9c0dcdac248c2e1b7fce005e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/op-editor-ui/src/widgets/drag_flow.rs:496-501 | crates/op-editor-ui/src/widgets/drag_flow_index.rs:386-391 | crates/op-editor-ui/src/widgets/slides_panel.rs:688-693 | crates/op-editor-ui/src/widgets/slideshow_toolbar.rs:221-226 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/drag_flow.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/drag_flow_index.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/drag_flow.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71313a11df0add108e710fd36e6864a1649bdc1068322fd243a3e9179b082f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/drag_flow.rs:503-510 | crates/op-editor-ui/src/widgets/drag_flow_index.rs:393-400 \u2014 before extracting anything, compare \u0060crates/op-editor-ui/src/widgets/drag_flow.rs\u0060 and \u0060crates/op-editor-ui/src/widgets/drag_flow_index.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/drag_flow.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a651680ea6dd18b38dbde20fc3dab330bb60be53a8cbd35330ac52d1601015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_copy.rs:212-222 | crates/op-editor-ui/src/widgets/top_bar_geometry.rs:462-472 \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":"crates/op-editor-ui/src/widgets/home_surface_copy.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f175a678ba5702057abac92a7863ae1a7074bd8d2c4726c3bbc64891607b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/html_import_diagnostics_panel.rs:311-321 | crates/op-editor-ui/src/widgets/missing_fonts_panel.rs:340-350 \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":"crates/op-editor-ui/src/widgets/html_import_diagnostics_panel.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"42653111a249d1d79fd28630bf2da7b0fe248e30f3c79a79d783204670fc86f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/layer_panel.rs:385-392 | crates/op-editor-ui/src/widgets/variables_panel.rs:764-771 \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":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b24ea81d37e1330ee82aacdf5ea19d1f05de36cc2dc29ed19db9ee3c9fe17c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/prompt_center_panel.rs:370-378 | crates/op-editor-ui/src/widgets/scene_template_panel.rs:393-401 \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":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaad33ddce946ec2cdc3be4b5d947a79b96902e0408f88338d707c58a044e4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/op-editor-ui/src/widgets/prompt_center_panel.rs:681-685 | crates/op-editor-ui/src/widgets/variables_panel/geometry.rs:84-88 | crates/op-host-native/src/widget_host/variables_preset_press.rs:267-271 | crates/op-host-web/src/widget_host/variables_preset_press.rs:169-173 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_preset_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_preset_press.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e678660d88db690f831685e530689e0b8a120125312a84df66c1e35ed89f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs:261-265 | crates/op-editor-ui/src/widgets/property_panel_corner.rs:67-71 \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":"crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa08d84b39dca32d0b7472f1e3c907e25928737ca78dfd1750749eb3ca2dc23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint_cards.rs:37-41 | crates/op-editor-ui/src/widgets/workspace_surface_paint.rs:32-36 \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":"crates/op-editor-ui/src/widgets/home_surface_paint_cards.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363ad53892c6b6b16abcbc743602e5647828841aba9f6e6c185adda72a28e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/util.rs:176-182 | crates/op-host-services/src/chat_subprocess_antigravity_log.rs:143-149 \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":"crates/op-editor-ui/src/util.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c2c0fd53db9c3481ec578f181db69ee09c23bfe02c903ce04ad2ccf1ac7666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/variables_panel/menus.rs:19-25 | crates/op-editor-ui/src/widgets/variables_panel/paint.rs:32-38 \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":"crates/op-editor-ui/src/widgets/variables_panel/menus.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d04f439854eb7fe01e2ebe475f1e99831a40e88fdd06192355b673a06f3fcf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs:511-520 | crates/op-editor-ui/src/widgets/scene_template_panel_paint.rs:400-409 \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":"crates/op-editor-ui/src/widgets/prompt_center_panel_paint.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a27f649b6c789c7ebe16410f88f36b36b43a19fd07f23d01b721f5685ceb058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs:107-114 | crates/op-preview-core/src/session_paint.rs:633-640 \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":"crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8cae527c3eea157bcc42ff51b6f8d05fca54ffecc43813cf012b37db4f91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat.rs:332-341 | crates/op-host-desktop/src/chat_session.rs:231-240 \u2014 before extracting anything, compare \u0060crates/op-engine-ffi/src/editor_chat.rs\u0060 and \u0060crates/op-host-desktop/src/chat_session.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84438f82096049ddf0ef93ab1c88e86ccabfcade314bc4d8edcccec680a719b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-engine-ffi/src/editor_codegen.rs:289-294 | crates/op-engine-ffi/src/editor_image_search.rs:261-270 | crates/op-engine-ffi/src/editor_model_discovery.rs:192-201 \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":"crates/op-engine-ffi/src/editor_codegen.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0298b716ce4f84a0fd8e3ef6a4089ebfe65c6fa199098cddbf29c8f8da9e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-engine-ffi/src/editor_codegen.rs:272-278 | crates/op-host-desktop/src/codegen_session.rs:39-45 \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":"crates/op-engine-ffi/src/editor_codegen.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fae12a2cf00ea605581dea77e07ed0770d1860f8096932b0b39e4603151248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat_design.rs:127-136 | crates/op-host-desktop/src/chat_session_launch.rs:720-729 \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":"crates/op-engine-ffi/src/editor_chat_design.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa4a834a6161010641142e046548fa6bf35116b12adf89f0d12e1fea8b95416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-engine-jni/src/callbacks.rs:437-443 | crates/op-engine-napi/src/callbacks.rs:204-210 \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":"crates/op-engine-jni/src/callbacks.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae113741579fcc37c04e3698867b06b9325410eca89047b9c333e5009886892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-desktop/src/design_loop_indicator.rs:53-58 | crates/op-host-services/src/web_chat_standard_events.rs:36-41 \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":"crates/op-host-desktop/src/design_loop_indicator.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4ef0d1ce70ee659cda424f9a054de5b79b15fef4a92cbb907c11d903db7328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-host-native/src/backend/skia/image.rs:524-528 | crates/op-host-web/src/canvaskit/convert.rs:65-69 | crates/op-pen-loader/src/layout_scene.rs:578-582 \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":"crates/op-host-native/src/backend/skia/image.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"9634ce74bab380352a4caf50757f47d6295b06f3fc02474ed1d6ade957072600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-host-native/src/backend/skia/path.rs:703-707 | crates/op-host-native/src/widget_host/auth_flow.rs:315-319 \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":"crates/op-host-native/src/backend/skia/path.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc19c7d0abd2edab7a52a0bd25139fb37dbce222f2ad11ac0fb43ae54d20df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/widget_host/slides_panel.rs:406-415 | crates/op-host-web/src/widget_host/slides_panel.rs:296-305 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/slides_panel.rs\u0060 and \u0060crates/op-host-web/src/widget_host/slides_panel.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 88 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":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c365f6a4f404888cd3db4740622e0613d9316555f0255d7833a7bf8d7fc2838b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-host-native/src/widget_host/text_edit_press.rs:282-295 | crates/op-host-web/src/widget_host/text_edit_caret.rs:4-15 \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":"crates/op-host-native/src/widget_host/text_edit_press.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40da6998ec9bb0e0ce7c9c161f8a2ed7cf1f5d1c6533d5d7fac39cc5871a29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_preset_press.rs:254-263 | crates/op-host-web/src/widget_host/keyboard_edit_ops.rs:90-99 \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":"crates/op-host-native/src/widget_host/variables_preset_press.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"af188544759928d64621b084ce03299ad1a0eed033e86f4ae8d1b518ba600b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-native/src/widget_host/variables_panel_row_press.rs:367-372 | crates/op-host-web/src/widget_host/variables_panel_rows.rs:340-345 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/variables_panel_row_press.rs\u0060 and \u0060crates/op-host-web/src/widget_host/variables_panel_rows.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 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":"crates/op-host-native/src/widget_host/variables_panel_row_press.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7c70f67edd2dd8075d98004ba8a096630038220fa64e84a9624dafa222e335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-native/src/widget_host/input.rs:728-735 | crates/op-host-web/src/widget_host/resize_drag.rs:103-110 \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":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"862c64576acd901f765a901132f38a1cca9b1e7abd00daa25e3ae746433afd16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:119-123 | crates/op-host-web/src/widget_host/preview_slideshow.rs:271-275 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e50a553473efba926165cc71fc255ca1b0c812d1af6d847b664c474d628561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:131-146 | crates/op-host-web/src/widget_host/preview_slideshow.rs:282-297 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb19555071be0e5dcc386d3c769a1dcf167b78cda6dfb1162fe825cfb8fd2903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-native/src/widget_host/preview_slideshow.rs:290-299 | crates/op-host-web/src/widget_host/preview_slideshow.rs:445-454 \u2014 before extracting anything, compare \u0060crates/op-host-native/src/widget_host/preview_slideshow.rs\u0060 and \u0060crates/op-host-web/src/widget_host/preview_slideshow.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 171 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":"crates/op-host-native/src/widget_host/preview_slideshow.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"303b60c47b21b3869f9970d4bcc99dd90157b63377333bdcc319554b090a8add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-services/src/chat_intent/context.rs:153-161 | crates/op-host-services/src/chat_system_prompt.rs:220-228 \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":"crates/op-host-services/src/chat_intent/context.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca42d140a8a20cef35d019f6d465e2b0f3c1368a23b348b50afc20cd76988d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-services/src/chat_system_prompt.rs:176-183 | crates/op-mcp/src/open_document.rs:138-145 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/chat_system_prompt.rs\u0060 and \u0060crates/op-mcp/src/open_document.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 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":"crates/op-host-services/src/chat_system_prompt.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a06aabe1bce317ec6ecd33e004614f55bebf56083da8a8bea70a00401e55e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-services/src/mcp_live/snapshot_ingest.rs:105-114 | crates/op-host-services/src/web_canvas_server/origin_guard.rs:22-31 \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":"crates/op-host-services/src/mcp_live/snapshot_ingest.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7239393daa35451ea7b477fd1447f7097e7f4591041fa44a868586c04b2dd80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-host-web/src/dom_io/html_directory_session.rs:363-375 | crates/op-host-web/src/dom_io/html_zip_session.rs:402-414 \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":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4d8fa365f1ba75395ee547ea00d6cec97f08976283c130b0f7a129bd4e405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-host-web/src/dom_io/html_directory_session.rs:485-489 | crates/op-html/src/project.rs:270-274 \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":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c604c7620b2f27fd1f0ecd068f4f63e32b4fc7a647855f438008d2e60d8233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-web/src/dom_io/html_directory_session.rs:491-496 | crates/op-html/src/project.rs:276-281 \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":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ef8c93793c19fdc4b9cfef85b6e7ed3ea322e64745fa91d24d14a40450de4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-web/src/web_acp_connect.rs:170-176 | crates/op-host-web/src/web_agent_connect.rs:175-181 \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":"crates/op-host-web/src/web_acp_connect.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9434277fe4e9baea4f70323f9b7076f13a1c8b696be42e43c51913bccc8db2d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-html/src/lib.rs:512-519 | crates/op-html/src/special.rs:439-446 \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":"crates/op-html/src/lib.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4b68296a77a73ef5094044a01c622519d54885dc7c650e63d71c2eaaa96fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-html/src/mapper_intrinsic.rs:158-167 | crates/op-html/src/special_image.rs:589-598 \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":"crates/op-html/src/mapper_intrinsic.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5ec44de6d991a9d1a4f42afb8ffbc00ebe3fbfa382da508efba3aa92798e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-html/src/mapper_visual.rs:609-616 | crates/op-html/src/text.rs:504-511 | crates/op-html/src/transform.rs:307-314 \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":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83829644b5de631c6ec5b0cf99a2fde92c6446094121134cb72f69b5dcd7ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-html/src/project_zip.rs:353-357 | crates/op-html/src/zip_encoding.rs:133-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/project_zip.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"141e05bf863f92d000d7ae5fad09f6ddf30ccf25b68fb6a8b7820e0e7c942b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-html/src/project_zip.rs:359-363 | crates/op-html/src/zip_encoding.rs:139-143 \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":"crates/op-html/src/project_zip.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee624def674710ffcd0bb4f55575ff885a17adaf7ad5a5acb894c68df66db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-html/src/special_image.rs:492-502 | crates/op-html/src/text_layout.rs:91-101 \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":"crates/op-html/src/special_image.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7cad53976d4a9ac91e04f5ab8d60dc0fe4879b4de314e0b9b7f8bf5430d6eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-html/src/text_children.rs:531-545 | crates/op-html/src/text_inline.rs:318-332 \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":"crates/op-html/src/text_children.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91dc210b98571f607a202980fe1e7b6418290d4041a47e2f504a95ddeea92f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-image-enrich/src/fallback_policy.rs:91-96 | crates/op-orchestrator/src/mobile_content_rail_header.rs:216-221 \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":"crates/op-image-enrich/src/fallback_policy.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"706f6f16c6f69abd98743b2264c22ba237e60abca17698ad97f2a5c7705f6c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-mcp/src/batch_design_result.rs:246-251 | crates/op-mcp/src/design_refine_result.rs:158-163 \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":"crates/op-mcp/src/batch_design_result.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"393ac1a0d87a2db2a0807bd0b8509fc8a4ab50c7c566a30b805cdc602135abd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-mcp/src/document_save.rs:72-81 | crates/op-mcp/src/theme_presets.rs:187-196 \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":"crates/op-mcp/src/document_save.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b92c425972e305479e9e754e3242b29fee966c45efcb58e3a6926f696b10d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-mcp/src/batch_direct_ops.rs:378-383 | crates/op-mcp/src/update_node_data.rs:152-157 | crates/op-mcp/src/write_tools.rs:634-639 \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":"crates/op-mcp/src/batch_direct_ops.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71a60bcfc13bd5b30b2f5c656403229e041e1c5c3372981221ab4e69bd982da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/op-orchestrator/src/board_trailing_void.rs:114-125 | crates/op-orchestrator/src/cleanup_section_margins.rs:293-304 | crates/op-orchestrator/src/cleanup_slide_padding.rs:399-410 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/cleanup_section_margins.rs\u0060 and \u0060crates/op-orchestrator/src/cleanup_slide_padding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/board_trailing_void.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06a211705c960f9899a02df6c876063788a44e440ac164dc581c4fa86b66a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/op-orchestrator/src/board_trailing_void.rs:127-137 | crates/op-orchestrator/src/cleanup_section_margins.rs:281-291 | crates/op-orchestrator/src/cleanup_slide_padding.rs:421-431 | crates/op-orchestrator/src/geometry_validation.rs:132-142 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/cleanup_section_margins.rs\u0060 and \u0060crates/op-orchestrator/src/cleanup_slide_padding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/board_trailing_void.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d17c79dd1c626909346c57f23ba089f2fcb7c356df5aeb887588640c7018a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:170-174 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:190-194 \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":"crates/op-orchestrator/src/cleanup_desktop_dashboard.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6010610980aebf54ff70afc98821e09dc428451ef3330a59a020d15821342d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:221-226 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:196-201 \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":"crates/op-orchestrator/src/cleanup_desktop_dashboard.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"534312b47599f462b033cd132baf2a9c5f4e3e5687abcde1e29281afee62f7c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/op-orchestrator/src/cleanup_desktop_dashboard.rs:235-243 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:265-273 | crates/op-orchestrator/src/cleanup_root_and_nav.rs:231-239 | crates/op-orchestrator/src/cleanup_typography.rs:103-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_desktop_dashboard.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4902923b0a45534efbef645ada4d6128179f5ebd9a731e7fb965ad8aeda610a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/cleanup_equalize_siblings.rs:509-514 | crates/op-orchestrator/src/orchestration_self_check.rs:671-676 \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":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ad316440061801b9edca48937e13d4c26904be3337270d4f3ef6910e74bea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/cleanup_slide_padding.rs:681-689 | crates/op-orchestrator/src/output_language.rs:293-298 \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":"crates/op-orchestrator/src/cleanup_slide_padding.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc960efd9b91c3e40031e03067522bd35ecedf1b521043219f187ea22a1d1bfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-orchestrator/src/geometry_validation.rs:116-123 | crates/op-orchestrator/src/image_fallback_policy.rs:22-29 | crates/op-orchestrator/src/radial_repair.rs:453-460 \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":"crates/op-orchestrator/src/geometry_validation.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa3f98687c53ace0297b51fe2ef6ff16ed8b68e12ae30edbe6c7249c6a97548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/orchestration_self_check.rs:702-708 | crates/op-orchestrator/src/role_post_pass/mobile_search_header.rs:185-191 \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":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8f2619ee0b623fa794868f769e3442d5961bccef35b94cd1b64881b8de9e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/op-orchestrator/src/chip_repair.rs:31-37 | crates/op-orchestrator/src/radial_repair.rs:782-788 | crates/op-orchestrator/src/ring_repair.rs:358-364 | crates/op-orchestrator/src/sidebar_archetype.rs:467-473 | crates/op-orchestrator/src/stub_repair.rs:217-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/chip_repair.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"194ae5672d81b583e031c216ea905441ee3a747a1722236edd4d7a6e36785c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-orchestrator/src/geometry_diagnostics_collect.rs:116-120 | crates/op-orchestrator/src/sidebar_archetype.rs:486-490 | crates/op-orchestrator/src/stub_repair.rs:232-236 \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":"crates/op-orchestrator/src/geometry_diagnostics_collect.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"849ddeeefd353a1a07c539697accb646c72ecd3b4dfb067307db9d300604e96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-orchestrator/src/stub_repair.rs:170-177 | crates/op-orchestrator/src/text_contrast_repair.rs:584-591 \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":"crates/op-orchestrator/src/stub_repair.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cdd8616bd0c6de0ac9c7d8cddf056a1b541352648548ebff4b99075f2d96e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/app_shell_detect.rs:7-12 | crates/op-orchestrator/src/table_repair.rs:57-61 \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":"crates/op-orchestrator/src/app_shell_detect.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00cafae5ce4bccb5bc9762d870c0ba79cf5668ddcdc452accb2d2b67010a900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:219-224 | crates/op-orchestrator/src/touch_target_floor.rs:153-158 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d2a6d8a39e7352485e6b56a804bfa45b517805c6ec1678872f944b50454068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:274-278 | crates/op-orchestrator/src/touch_target_floor.rs:227-231 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e41728365479bda095d1f5b97fca3ae99584fc5a8a736e3ea23e81e7269fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-orchestrator/src/card_inner_padding.rs:300-310 | crates/op-orchestrator/src/touch_target_floor.rs:253-263 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/card_inner_padding.rs\u0060 and \u0060crates/op-orchestrator/src/touch_target_floor.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"445ae3faf3870ba31c33b2670241f23befeebd0d0229b6b76b680a098d47084d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-chat-agent/src/chat_canvas_tools.rs:48-53 | crates/op-chat-agent/src/design_agent_tools.rs:112-117 \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":"crates/op-chat-agent/src/chat_canvas_tools.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e8866f73bb2c6292b863334aff40f03462913112d9ff7fbf76f56d03d54638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-codegen/src/lib.rs:277-282 | crates/op-mcp/src/style_ops_tools.rs:489-494 \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":"crates/op-codegen/src/lib.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1f36e99f9ad20d39ac3b1b53fcd582e069b7ab18d6c59c2656d3a6a64cbfbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-collab/src/guest.rs:404-413 | crates/op-collab/src/session.rs:352-361 \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":"crates/op-collab/src/guest.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93928dd58a7fa1541cd803d0af3929ac334fa4b4ed72d20f54e26695d2b3eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-collab/src/diff.rs:216-220 | crates/op-collab/src/diff_fields.rs:293-297 \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":"crates/op-collab/src/diff.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"390ec4e44ba454bacf6bd30b8096bf509419a3e2ced475692473ce714fc9277b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/op-collab-relay-protocol/src/locator.rs:99-104 | crates/op-collab-relay-protocol/src/sensitive.rs:14-19 | crates/op-collab-relay-protocol/src/sensitive.rs:43-48 | crates/op-collab-relay-protocol/src/sensitive.rs:84-89 | crates/op-collab-relay-protocol/src/sensitive.rs:106-111 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-protocol/src/locator.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3876b0b85bd6c5cf0c97be2fb132d1843a8f4fc7b9d4a55b060224819ebff3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-collab-transport/src/queue.rs:318-325 | crates/op-collab-transport/src/reassembly_budget.rs:44-51 \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":"crates/op-collab-transport/src/queue.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce441871b138d77718da753aca5642eeedc8bcfc54f96aea58ec62c24a2227c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-design-lint/src/node_mut.rs:151-158 | crates/op-editor-core/src/state.rs:346-353 | crates/op-orchestrator/src/validation_dump.rs:443-450 \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":"crates/op-design-lint/src/node_mut.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f717b9cc4b2cfb2b92c98a456ae5f66bfae7531bb9e4be425a25e7d8cfc914a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-core/src/prompt_center_catalog.rs:162-169 | crates/op-editor-core/src/scene_template_catalog.rs:513-520 \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":"crates/op-editor-core/src/prompt_center_catalog.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a52cf653b6327483910757b6c869191d7b77f34af70e5565edebd2c8a38764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-core/src/ref_resolve.rs:177-182 | crates/op-editor-core/src/variables_resolve.rs:411-416 \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":"crates/op-editor-core/src/ref_resolve.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc366de6f331d383fb5b57dcb5dd135300740986bc2e4239df46e9479bc2de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-core/src/image_drop.rs:23-33 | crates/op-editor-ui/src/widgets/align_toolbar.rs:342-352 \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":"crates/op-editor-core/src/image_drop.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd10be677aa199c1aed7b3bc172f584d2dc0998545c03fefb893f32c548905f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_acp.rs:735-743 | crates/op-editor-ui/src/widgets/agent_settings_acp_presets.rs:227-235 \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":"crates/op-editor-ui/src/widgets/agent_settings_acp.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d98793b3e55a9d2acb363e6012eea7f62bca2cb397e58809010ee376d88444e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/export_quick_menu.rs:92-97 | crates/op-editor-ui/src/widgets/file_menu.rs:247-252 \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":"crates/op-editor-ui/src/widgets/export_quick_menu.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6246cafbe8ecf4ce27159bc381151a8e0a731e5305c43357bdba8a5d075b162b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-editor-ui/src/widgets/file_menu.rs:338-343 | crates/op-editor-ui/src/widgets/shape_picker.rs:177-182 \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":"crates/op-editor-ui/src/widgets/file_menu.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a11307b68cbcf1dda68da899df0be1d291dd03af52f019901e8b0ffe68aaf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/import_menu.rs:109-118 | crates/op-editor-ui/src/widgets/locale_picker.rs:63-72 \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":"crates/op-editor-ui/src/widgets/import_menu.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff052d1bbe6fdf56bbb1645b7eb04058d4bf9a3aeff22c6ca7604f37ce90ad4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-editor-ui/src/widgets/prompt_center_panel.rs:157-164 | crates/op-editor-ui/src/widgets/scene_template_panel.rs:273-280 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_panel.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89ba5d3e271745975c2ba1ceacaf0501df4b4f1f4d397434c2f8ac7c570bbde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/op-engine-jni/src/bindings_editor.rs:704-711 | crates/op-engine-jni/src/bindings_editor.rs:755-762 | crates/op-engine-jni/src/bindings_editor.rs:770-777 | crates/op-engine-jni/src/bindings_text.rs:19-26 | crates/op-engine-jni/src/bindings_text.rs:43-50 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-jni/src/bindings_editor.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0455dc17b3b6cc9de0730810c162771143e50c8b86ad52a99ac7d22b36fee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-engine-jni/src/bindings_editor.rs:449-460 | crates/op-engine-napi/src/bindings_editor.rs:301-313 \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":"crates/op-engine-jni/src/bindings_editor.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7002760b6010f5224db1c0d00b41ddb0dda671842cd989b9174dcfc9bf67600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/op-engine-napi/src/bindings_editor.rs:145-151 | crates/op-engine-napi/src/bindings_editor.rs:184-190 | crates/op-engine-napi/src/bindings_editor.rs:193-199 | crates/op-engine-napi/src/bindings_media.rs:26-32 | crates/op-engine-napi/src/bindings_text.rs:43-49 | crates/op-engine-napi/src/bindings_text.rs:58-64 \u2014 there are 6 copies across 3 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-napi/src/bindings_editor.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2381b6b5f882c412468117a54ae98d34ba4f53a3d5a507e282e139e3054c278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/op-orchestrator/src/cleanup.rs:139-149 | crates/op-orchestrator/src/cleanup.rs:199-209 | crates/op-orchestrator/src/mobile_content_rail.rs:24-34 \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":"crates/op-orchestrator/src/cleanup.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1340eb92dc003f8fb1305924f305eb7f60aaa364ee7b039d4c2e177d18ebba06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/op-orchestrator/src/cleanup_bottom_nav_repairs.rs:84-93 | crates/op-orchestrator/src/cleanup_clip_row_stroke.rs:39-48 | crates/op-orchestrator/src/cleanup_container_geometry.rs:40-49 \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":"crates/op-orchestrator/src/cleanup_bottom_nav_repairs.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b868d101529056b93ab91eee63d0cbd440ef10077fb537df56cbec40f203c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/op-editor-host-core/src/settings_io_checked.rs:38-58 | crates/op-host-web/src/web_settings_validation.rs:367-387 \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":"crates/op-editor-host-core/src/settings_io_checked.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f26f892ccb21799ecafd0b1a14b6e6b63192241ed6fd6a7356cd18aa999709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/op-editor-ui/src/widgets/file_menu_paint.rs:52-67 | crates/op-editor-ui/src/widgets/file_menu_paint.rs:74-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/file_menu_paint.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf35cb8cff89e6eb6fe1297f23a69aba1b83f4cdeec8a2760c7e9d59a120b288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/op-editor-ui/src/widgets/icon_catalog.rs:394-408 | crates/op-editor-ui/src/widgets/icon_catalog.rs:413-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/icon_catalog.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12fb31d7258e6a4ff88dc45fadc4b53e62c905f9f42049f3013ac46a2beae37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-codegen/src/codegen_html.rs:86-97 | crates/op-codegen/src/codegen_targets.rs:335-348 \u2014 before extracting anything, compare \u0060crates/op-codegen/src/codegen_html.rs\u0060 and \u0060crates/op-codegen/src/codegen_targets.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"01420e48f70a111592dac7baca9213ab77c7a59ae2e92f415fdec137cd067a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/op-host-services/src/mcp_live/connection.rs:292-305 | crates/op-host-services/src/mcp_live/snapshot_ingest.rs:235-248 \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":"crates/op-host-services/src/mcp_live/connection.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0077eeadb4502a42235393d9de6e4c50fc004fa4df826d47b3afd799d62f87d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/op-mcp/src/import_html_tool.rs:25-37 | crates/op-mcp/src/import_snapshot_tool.rs:26-38 | crates/op-mcp/src/write_tools_import_svg.rs:29-41 \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":"crates/op-mcp/src/import_html_tool.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"14889e7f29370d215d5d02285dd26ce6273e73524bcc47ec56b694f684782ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-orchestrator/src/validation_fixes_apply.rs:343-355 | crates/op-orchestrator/src/validation_fixes_apply.rs:382-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":"crates/op-orchestrator/src/validation_fixes_apply.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac82858eb7e6238b77125ff5549bcb86797276dad016c00025233077e87cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-image-enrich/src/fallback_policy.rs:351-362 | crates/op-image-enrich/src/fallback_policy.rs:377-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/fallback_policy.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54e467af2831f5c154defb43a3569cc1e90ddbc9c5419a8a6825e92666a7008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-editor-ui/src/widgets/component_browser_panel.rs:550-562 | crates/op-editor-ui/src/widgets/icon_picker_panel.rs:331-343 \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":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95f50b66b3be18891037b7e3e83abc22fac20e9d53144a47c5cc449ac30098c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-mcp/src/page_tools.rs:532-543 | crates/op-mcp/src/scalar_vars.rs:159-170 \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":"crates/op-mcp/src/page_tools.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"86923bc38a3f5a9d6688dbe3a6b0068fc89939bab4bcafd4579c960b574b24ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/op-mcp/src/scalar_vars.rs:48-59 | crates/op-mcp/src/scalar_vars.rs:160-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/scalar_vars.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"223489883b94e1e54db67322ebbacb3c5c79289709de55fab5443bd0fe376d71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/op-mcp/src/node_attr_tools.rs:102-110 | crates/op-mcp/src/node_attr_tools.rs:140-148 | crates/op-mcp/src/node_attr_tools.rs:255-263 | crates/op-mcp/src/node_attr_tools.rs:313-323 \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":"crates/op-mcp/src/node_attr_tools.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"810d5561ceaa4bbffbdac72373916bc042a8e2c671b39f8f547dae4faff1826a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-mcp/src/script_runner.rs:101-111 | crates/op-mcp/src/script_runner.rs:115-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/script_runner.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1004b0317cad2abd56720447c1d26f80136c48b15e13b6abf86a5548e9b56813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs:161-171 | crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs:303-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface_paint_art_screens.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"62183cb86bd99c979fbac4daefdf74a5ed7fabb97bf139063817c7e3d4c9f52f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:214-224 | crates/op-host-services/src/web_canvas_server/run_loop.rs:148-158 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/web_canvas_server/online_run_loop.rs\u0060 and \u0060crates/op-host-services/src/web_canvas_server/run_loop.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e55909077910705ef7ee20e0d41439af3bb56ca56b944e8462d99caeda9edf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-ui/src/widgets/component_browser_panel.rs:466-476 | crates/op-editor-ui/src/widgets/design_md_panel.rs:455-465 \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":"crates/op-editor-ui/src/widgets/component_browser_panel.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2db1e3ce835cffd33c4fc4dd8320acef126b5476fff3f82cb57501fd94cf25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-mcp/src/node_attr_tools.rs:469-477 | crates/op-mcp/src/page_tools.rs:495-503 | crates/op-mcp/src/write_tools.rs:279-289 \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":"crates/op-mcp/src/node_attr_tools.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef3efa667ae7bd4f9d7d79fbd4d3f1f09952ada56d31375927c7bc3565ce66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-auth-bridge/src/collab_claims.rs:296-306 | crates/op-editor-core/src/collab_owner_confirm_ui.rs:88-98 \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":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd7d058897b810f819a6363c67ca31f857f385d6de878c962756d16c1f158a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-editor-core/src/prompt_center_catalog.rs:311-321 | crates/op-editor-core/src/scene_template_catalog.rs:687-697 \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":"crates/op-editor-core/src/prompt_center_catalog.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3af421225e0b6a3af21b61a12bdff98baea8e2cf64b4d454e39474a4d5e0242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-cli/src/html_cli.rs:19-29 | crates/op-cli/src/html_cli.rs:112-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/html_cli.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8671d964b7b10b4ec96aec990471a8e177e7278b14d3a9a2c4e0d62ed22cbe6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/op-mcp/src/node_attr_tools.rs:32-40 | crates/op-mcp/src/node_attr_tools.rs:102-110 | crates/op-mcp/src/node_attr_tools.rs:140-148 | crates/op-mcp/src/node_attr_tools.rs:178-188 | crates/op-mcp/src/node_attr_tools.rs:255-263 | crates/op-mcp/src/node_attr_tools.rs:313-323 | crates/op-mcp/src/scalar_vars.rs:48-58 \u2014 there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/node_attr_tools.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58b723dff94956d8e8f523cb33d2efe63d87efbb1d939b8dc0685d32a62c3ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/op-collab-smoke/src/fault_guest.rs:192-202 | crates/op-collab-smoke/src/fault_guest.rs:207-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_guest.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"134d62850362aae596366d958b36271c02eef64eea861944d144379b5598e5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/html_import_diagnostics_panel.rs:376-385 | crates/op-editor-ui/src/widgets/missing_fonts_panel.rs:489-498 \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":"crates/op-editor-ui/src/widgets/html_import_diagnostics_panel.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a37cd3c43d1ad0297df1bd6407104af79c235f67a00288f3940c540498921d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:128-137 | crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs:334-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images/paint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66bb078fe364dbbe0401db8a6ed285b50e89fb75c884b867c8d6e6049b7974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-mcp/src/codegen_tools.rs:73-82 | crates/op-mcp/src/codegen_tools.rs:123-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_tools.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e44520276139e0097a2f214783085df220be16980934eeeab05ef98c8c5a4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-web/src/live_sync.rs:123-132 | crates/op-host-web/src/live_sync.rs:183-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2421d3ea0946b139a3c2174ffebb861dc0da106a21cbfaf078a360e95ffb23fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-engine-ffi/src/editor_chat.rs:734-743 | crates/op-engine-ffi/src/editor_model_discovery.rs:206-215 \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":"crates/op-engine-ffi/src/editor_chat.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e814e7ad755d05870f0f12729ffdc6c67489d44854cac9d76632d28add097f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-design-lint/src/detectors/structure.rs:225-234 | crates/op-orchestrator/src/validation_chart_guard.rs:53-62 \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":"crates/op-design-lint/src/detectors/structure.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30abc2ccd4b70d7a4c7d6325c341f0bf90c761a3f3fa7caeed2b5991f01baa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-orchestrator/src/role_post_pass/micro_surface_radius.rs:271-280 | crates/op-orchestrator/src/spacing_repair.rs:160-167 \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":"crates/op-orchestrator/src/role_post_pass/micro_surface_radius.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fa7018f51d35e03b9e9e6f9e7d2019aa50afcf8a36d03440b45a66d9d5b284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs:368-377 | crates/op-orchestrator/src/ring_repair.rs:335-344 \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":"crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"45983251c3667e07c928376fc850464961f19346efcd68b38be8ee550974d8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab-smoke/src/fault_owner.rs:170-179 | crates/op-collab-smoke/src/fault_owner.rs:369-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab42d627d352270458410dc6b45048456bf5285c1e6756ecaf052bef664a5920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-mcp/src/scalar_vars.rs:33-42 | crates/op-mcp/src/scalar_vars.rs:144-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/scalar_vars.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"161b5a7ade64775c5890e29dbd2425bbab36113bac6689d24b456dd8271b02c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-orchestrator/src/concurrent.rs:277-286 | crates/op-orchestrator/src/concurrent.rs:354-363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acee3c61d568e8c4decf3af41ea7a20b33aeb444480148bf8be1c2ba979ddff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-host-services/src/web_image_generate.rs:543-552 | crates/op-host-services/src/web_image_generate_atlas.rs:72-81 \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":"crates/op-host-services/src/web_image_generate.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f9c20ca3209f63bac74ead5faaf5fa773ad40aae9ab5c634722d234ad13541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/node_attr_tools.rs:387-396 | crates/op-mcp/src/page_tools.rs:175-183 \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":"crates/op-mcp/src/node_attr_tools.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb8d0e3a4abd6cf4b13c05930c2c6573b4c94d2d823a682070bd464ad01e48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-collab-smoke/src/fault_owner.rs:78-86 | crates/op-collab-smoke/src/fault_owner.rs:115-123 | crates/op-collab-smoke/src/fault_owner.rs:168-176 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4344748459a0722a4d0f8da1674d77d2f96f636e2e616fb34461507efa60759e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/import_html_tool.rs:39-47 | crates/op-mcp/src/import_snapshot_tool.rs:40-48 \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":"crates/op-mcp/src/import_html_tool.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce35dc2181918d315ca62a930ef9d97171e734981228b2bb80855d372967b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/export_dialog.rs:119-125 | crates/op-editor-ui/src/widgets/export_dialog.rs:152-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/export_dialog.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d796b7e5ae1ab8a59e0d81e378934ca81ea84d159344520c534ff8f6b289bce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-editor-ui/src/widgets/property_panel_fill_body.rs:166-174 | crates/op-editor-ui/src/widgets/property_panel_video.rs:168-176 \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":"crates/op-editor-ui/src/widgets/property_panel_fill_body.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b30fcc0588deaaf8e155261b515f887c3a655ce1260658250291bd24293a377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-codegen/src/codegen_html.rs:98-106 | crates/op-codegen/src/codegen_targets.rs:349-355 \u2014 before extracting anything, compare \u0060crates/op-codegen/src/codegen_html.rs\u0060 and \u0060crates/op-codegen/src/codegen_targets.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/codegen_html.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf95ba0a5922affb5318b4e84107330db194870280cba10cdd34a7f32deabf0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-web/src/file_actions.rs:135-141 | crates/op-host-web/src/file_actions.rs:196-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/file_actions.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a2870fc24820dcebab0f10541f0ea208423e82e46cc69dfb406504f6768205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:254-262 | crates/op-host-services/src/web_canvas_server/run_loop.rs:185-193 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/web_canvas_server/online_run_loop.rs\u0060 and \u0060crates/op-host-services/src/web_canvas_server/run_loop.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02af64804459c057f9c403b73d5c5738263360233d902b4ddcb7cf2d4496b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-figma/src/mappers.rs:519-527 | crates/op-figma/src/mappers.rs:546-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/mappers.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebcb20d0952889d22f7da9ee6e75ab17e349c04fecb23ea089e0d659de714fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-mcp/src/write_tools.rs:37-45 | crates/op-mcp/src/write_tools.rs:317-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/write_tools.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc7223519ff85b70912a0071a0e1f5b4a352bcfb0c4593b774a06fbca454463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/op-pen-loader/src/widget_payload.rs:30-38 | crates/op-pen-loader/src/widget_payload.rs:50-58 | crates/op-pen-loader/src/widget_payload.rs:70-78 | crates/op-pen-loader/src/widget_payload.rs:140-148 | crates/op-pen-loader/src/widget_payload.rs:197-205 \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":"crates/op-pen-loader/src/widget_payload.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0646fa1ca085956dd58c2c9aa088fb4494e82b2ba83a722b706dbaad1f05c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-host-services/src/web_image_generate.rs:375-381 | crates/op-host-services/src/web_image_generate.rs:444-450 | crates/op-host-services/src/web_image_generate.rs:514-522 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_image_generate.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0b5f45d3423e2f1e00e124dc199dddc0e699a2a065315978e33e00badabfe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-engine-ffi/src/editor_builtin_provider.rs:203-211 | crates/op-host-services/src/chat_builtin_http.rs:220-227 \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":"crates/op-engine-ffi/src/editor_builtin_provider.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dfbf2c487eec9e7890d721334640f2dd3a8b07199ad4b5570a167a32e198e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-host-services/src/cli_model_discovery.rs:73-80 | crates/op-host-services/src/cli_model_discovery.rs:148-155 | crates/op-host-services/src/model_discovery.rs:395-402 \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":"crates/op-host-services/src/cli_model_discovery.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2561dbf2ea44683fdc71805701a04c186b7370ad658bb76d44aa5279ea92530e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-pen-loader/src/widget_payload.rs:88-95 | crates/op-pen-loader/src/widget_payload.rs:104-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/widget_payload.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8458cb5f7aeaa9651741879269dafa17be81014fd5d3c943be4be741921a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-host-desktop/src/persistence_export_html.rs:63-70 | crates/op-host-desktop/src/persistence_export_pptx.rs:63-70 \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":"crates/op-host-desktop/src/persistence_export_html.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cb0673b9df0a32d54f712fecce0a3c14f491bc48c2f9c4b836ee102f49eb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/op-pen-loader/src/widget_payload.rs:121-128 | crates/op-pen-loader/src/widget_payload.rs:157-164 | crates/op-pen-loader/src/widget_payload.rs:179-186 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/widget_payload.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebed9266be6ac14a3a73648133902eeb4e1fa4261435b146e91266060a033935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/cleanup_equalize_siblings.rs:369-375 | crates/op-orchestrator/src/cleanup_equalize_siblings.rs:384-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d4e6df832ad2404b445b2bd96c48ea219c6b7202afb38c1f4c1581c358a63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-web/src/codegen_web.rs:392-398 | crates/op-host-web/src/codegen_web.rs:407-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/codegen_web.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e04ffec73958792bc9694cd143ff65f2209f335a2ec1ec132934855774bc475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-cli/src/export_cli.rs:111-118 | crates/op-cli/src/export_cli.rs:183-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/export_cli.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275c520f3043e80d8c68e588b679fd958271c68c743cda5cab33d54d013d943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs:477-484 | crates/op-editor-ui/src/widgets/ai_chat_panel_paint.rs:57-63 | crates/op-editor-ui/src/widgets/settings_form.rs:38-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images_parts.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4bfadee2bbd9f2f1cf4e189627dc9628f069e3965de6890c6b3a2fda147197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/op-cli/src/export_cli.rs:102-109 | crates/op-cli/src/export_cli.rs:174-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/export_cli.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df0e30c5aefea6f81e6bf23f1afba8cdacbae7231cebec97bd386444d42c67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/op-editor-core/src/agent_indicators.rs:706-713 | crates/op-editor-host-core/src/chat.rs:108-115 | crates/op-editor-host-core/src/chat.rs:132-139 | crates/op-editor-host-core/src/chat.rs:143-150 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/agent_indicators.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c76dbba5d0df7a2d52d7a06f4cf8dabb656c26c7ce03cc16ecd4d5dbb23a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-smoke/src/fault_owner.rs:147-153 | crates/op-collab-smoke/src/fault_owner.rs:197-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a283b7ccfa31cd7b4e05b2c07e6b19565c0ecbc3bf99a9194cba4b382e15edc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-pen-loader/src/adapter/shapes.rs:103-109 | crates/op-pen-loader/src/adapter/shapes.rs:159-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/adapter/shapes.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b6d7c6a7e09235bf25a823da610586a452897e7684b75f98713c4646453543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-editor-ui/src/widgets/ai_chat_transcript_tools.rs:310-316 | crates/op-editor-ui/src/widgets/ai_chat_transcript_tools.rs:358-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_tools.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2343f600f3b53a2af14fc9f750dcc5c163d7747b5a960d55b45c3b39b52b6531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-desktop/src/chat_acp.rs:474-480 | crates/op-host-desktop/src/chat_acp.rs:515-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_acp.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cacdebd8561a424bc3ef553f5617e13dbd066a77cee5972be0f6ee1616a4fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-mcp/src/batch_direct_ops.rs:154-159 | crates/op-mcp/src/batch_direct_ops.rs:182-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_direct_ops.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c65196675ea1585d4e48fe8e2cb95aa48f15bf085b767ae2855b89f611c0913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-collab-smoke/src/fault_owner.rs:91-97 | crates/op-collab-smoke/src/fault_owner.rs:187-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"983c5ab785ecc553b4cf5a14256b060ccd9beac4f599237f9846e0f1f7c83e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-host-desktop/src/figma_import_session.rs:488-494 | crates/op-host-desktop/src/html_import_session.rs:262-268 \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":"crates/op-host-desktop/src/figma_import_session.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18327f96d88371172232fcbef70dbe99a2a454799e711784bf40d46a7ec9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-mcp/src/document_save.rs:39-45 | crates/op-mcp/src/theme_presets.rs:63-69 \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":"crates/op-mcp/src/document_save.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27920ee46e76f01243701222fa9e6e03bd8de382e178de9e40edf87e30e6475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-figma/src/mappers.rs:511-516 | crates/op-figma/src/mappers.rs:538-544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/mappers.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"859bd9028b030b226769f91e1bdf3534bd33f5f375b9f0377a181c19524457be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-engine-ffi/src/desc.rs:280-286 | crates/op-engine-ffi/src/desc.rs:435-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/desc.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d844156d5db914c1cc9fc6ac809e70b11bf185e8467ebe013615c663d96d4aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-collab-smoke/src/fault_owner.rs:238-243 | crates/op-collab-smoke/src/fault_owner.rs:311-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c635b50dcd39cee3836c6ab64e0eb8b1a77d306840d40096984013830975a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-mcp/src/read_tools_extra.rs:79-84 | crates/op-mcp/src/read_tools_extra.rs:127-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/read_tools_extra.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7ce4ead3733e1053e44c08d82a5bba12e0c63c1676b6bef582440d9065c7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-html/src/css/declarations.rs:628-633 | crates/op-html/src/css/declarations.rs:640-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"659fc97593f7fa06cd842e5d156c030b5d3801f38d904e6bd2ff6845e10b91e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-orchestrator/src/role_post_pass/layout_props.rs:109-114 | crates/op-orchestrator/src/role_post_pass/layout_props.rs:118-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/layout_props.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02ac730ae678f96a67e6af2da7dc6d65d4dae33991028b291cedc4b5540a549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-desktop/src/figma_import_session/publish.rs:66-71 | crates/op-host-desktop/src/legacy_op_upgrade.rs:164-169 \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":"crates/op-host-desktop/src/figma_import_session/publish.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5a6f58c008580548ac9e98610c2e133e67482ac16b9fffae4a79fdf8042e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-cli/src/skill_install_cli.rs:212-217 | crates/op-cli/src/skill_install_cli.rs:238-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/skill_install_cli.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"744a9c2feef1cd513d10866e31fd5352c622965588fcae35a0c30107e803d52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-web/src/file_actions.rs:150-155 | crates/op-host-web/src/file_actions.rs:207-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/file_actions.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a30435c47d08200c72a14913f63910931c0ae7b5895b8a594affcfde901474e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-host-services/src/web_canvas_server/online_run_loop.rs:240-245 | crates/op-host-services/src/web_canvas_server/run_loop.rs:173-178 \u2014 before extracting anything, compare \u0060crates/op-host-services/src/web_canvas_server/online_run_loop.rs\u0060 and \u0060crates/op-host-services/src/web_canvas_server/run_loop.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b100f17a8b4d5411afc017828ba2067ac6e2540d2919c8e133289a94a503a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-collab-smoke/src/fault_owner.rs:89-93 | crates/op-collab-smoke/src/fault_owner.rs:185-189 | crates/op-collab-smoke/src/fault_owner.rs:254-258 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-smoke/src/fault_owner.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa978a1cd1471b375d8ae71665a560fc18ef2953e37174d4c51bd41907548167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-orchestrator/src/category_grid_density.rs:203-207 | crates/op-orchestrator/src/repair_record.rs:418-422 | crates/op-orchestrator/src/role_post_pass/mobile_category_row.rs:81-85 \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":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9571b7ab3d16a21a939413557a9b6564546a8b76d4245afcc5aae3b8d69e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-host-web/src/file_actions.rs:134-138 | crates/op-host-web/src/file_actions.rs:195-199 | crates/op-host-web/src/file_actions/save_payload.rs:182-186 \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":"crates/op-host-web/src/file_actions.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ace374f4561ab7536a5db44cf753d653b87ddd887e05becd380c1ec9393753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-cli/src/page_theme_cli.rs:62-66 | crates/op-cli/src/page_theme_cli.rs:72-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/page_theme_cli.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"99071880f761113d86d73ea929402546336fb34d7add17fbfc3158f09ed9278c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/icon_catalog.rs:389-393 | crates/op-editor-ui/src/widgets/icon_catalog.rs:407-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/icon_catalog.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45693a2f5049ede4b20a17d3303f843e91a5e8ec022086f459ffd4a9b84e3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/op-codegen/src/lib.rs:253-260 | crates/op-design-lint/src/node_util.rs:414-421 | crates/op-editor-core/src/fills/access.rs:13-20 | crates/op-mcp/src/style_ops_tools.rs:433-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/lib.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c8a7cc30a06df840701b1b48b5170827eb70d166134ab243f18a556822e9c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-codegen/src/lib.rs:289-295 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:224-230 \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":"crates/op-codegen/src/lib.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e5f1146135118766232f24bb90eb6d48cd046bec928bbe42ed182be865d0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-codegen/src/lib.rs:299-307 | crates/op-orchestrator/src/cleanup_mobile_dense.rs:233-241 \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":"crates/op-codegen/src/lib.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdaaebaea820713629090ccef879c999cdfbf944a946f33c294b5bb7319f127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-collab/src/apply_tree.rs:357-365 | crates/op-orchestrator/src/validation_dump.rs:198-206 \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":"crates/op-collab/src/apply_tree.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"556b91526bb7b265c6fc547c24177ca8643ad8ee4a0ccc0ee94e3f4c8b75fa1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-collab/src/typed_images.rs:181-185 | crates/op-pen-loader/src/layout_repair.rs:752-756 \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":"crates/op-collab/src/typed_images.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db4776c60b978de07aea6bba3d3a980357e67623e9c6a281c56c327f41bcb3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-design-lint/src/missing_progress_ring.rs:280-288 | crates/op-pen-loader/src/legacy_payload_repair.rs:118-126 \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":"crates/op-design-lint/src/missing_progress_ring.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"594a459970603e462bdc528ea17696a31c38997da26287ed7b85a609cc30209a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-design-lint/src/node_util.rs:506-510 | crates/op-orchestrator/src/validation_dump.rs:284-288 | crates/op-orchestrator/src/validation_fixes_apply.rs:579-583 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/validation_dump.rs\u0060 and \u0060crates/op-orchestrator/src/validation_fixes_apply.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd317ad565ecc8d7192cd3ac21b49ce6f0c7f0689fb8ae90d03c8e74a13019b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/op-design-lint/src/node_util.rs:556-560 | crates/op-editor-core/src/property_edit_mutators.rs:743-747 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:281-285 | crates/op-editor-ui/src/widgets/property_panel_snapshot/node_props.rs:301-305 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/node_util.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff4508793b639e4123b31a99d3ded29ba7bcf6d2c8d5722ce6dec9db633b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/op-design-lint/src/node_mut.rs:174-182 | crates/op-figma/src/layout_positioning.rs:116-124 \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":"crates/op-design-lint/src/node_mut.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebe97623ca1ff172a5ed9c842b08f5e1767a140f49adbc3f1888bf96b1162bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/op-editor-core/src/command_style_replace.rs:417-425 | crates/op-editor-core/src/fills/access.rs:158-166 | crates/op-figma/src/clipboard.rs:562-570 | crates/op-orchestrator/src/variable_binding.rs:285-293 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/fills/access.rs\u0060 and \u0060crates/op-orchestrator/src/variable_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_style_replace.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e390ca4c1fa8a387403e6d611a99c45aac9cd1193f04f7115b10ac0ae47c9a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/op-editor-core/src/scene_vars.rs:280-284 | crates/op-editor-core/src/scene_vars.rs:365-369 | crates/op-editor-core/src/variables.rs:96-100 \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":"crates/op-editor-core/src/scene_vars.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6135aa8b8bbaebe5ede2e4f03caeb9935f42572872a5bb75f468a2bc0c72d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-editor-core/src/command_node_attrs/slots.rs:112-120 | crates/op-editor-core/src/fills/access.rs:65-73 | crates/op-orchestrator/src/variable_binding.rs:309-317 \u2014 before extracting anything, compare \u0060crates/op-editor-core/src/fills/access.rs\u0060 and \u0060crates/op-orchestrator/src/variable_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_node_attrs/slots.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbdcc9ed7235b44024735f5a250d461330258fb9af289b29a95d00c64c5a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/fills/access.rs:90-94 | crates/op-mcp/src/style_ops_tools.rs:457-461 \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":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b9ecee17ed6f1c48831aac0e1d7d34223594c50ca3534f7595c4a42be1f788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/fills/access.rs:98-102 | crates/op-mcp/src/style_ops_tools.rs:465-469 \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":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"81057e7511771bd0c71cc3e4f72264607e2fbf5c80e40a35042653f81e3e2acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/op-editor-core/src/fills/access.rs:222-231 | crates/op-host-services/src/pre_validator.rs:298-307 \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":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc911f1f5e7cd2dca0b7618ddad53e6921105193d8c4da59ecec7e33c0419e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/op-editor-core/src/fills/access.rs:233-241 | crates/op-host-services/src/pre_validator.rs:308-316 | crates/op-pen-loader/src/effects.rs:128-136 \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":"crates/op-editor-core/src/fills/access.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6557c5b0a0089d69fff18bd7d7df5a19b85a78724dbefaedc70af1f8e667597f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/command_apply/helpers.rs:73-77 | crates/op-mcp/src/batch_program_resolve.rs:184-188 \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":"crates/op-editor-core/src/command_apply/helpers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17d643afe44c5daf459a72273e65aacafe61cd2e1bad5a2c1efef0054e158a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-core/src/color_picker.rs:65-69 | crates/op-editor-core/src/color_picker.rs:87-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/color_picker.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d304a59b8f9a58f5c31ec0b0cadc842a134cffb5a45776fc22c74bc4757651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs:225-229 | crates/op-editor-ui/src/widgets/canvas_viewport_paint_mask.rs:219-223 \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":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff0eccfe6d919adf0082093ada69ce967b70610e161896776e394ed45673240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-html/src/mapper_margin.rs:124-128 | crates/op-html/src/mapper_margin.rs:129-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_margin.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb8e91b4f21f1a2c7698d29ce06785342df4974e5ee5cd865166278c872516e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-mcp/src/batch_program.rs:352-356 | crates/op-mcp/src/batch_program.rs:363-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":"crates/op-mcp/src/batch_program.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf833b3678743c2c3b615b93760bffa94ac1756e0534be297768ce95f6d2ac2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/op-orchestrator/src/loop_finalize.rs:182-187 | crates/op-orchestrator/src/role_post_pass/color_utils.rs:16-21 | crates/op-orchestrator/src/role_post_pass/color_utils.rs:29-34 \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":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"65699ba5b0720bc9130331a8db0fe1b440d84b0521f55189a25c80a5cc6083da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs:295-301 | crates/op-orchestrator/src/ring_repair.rs:263-269 \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":"crates/op-orchestrator/src/radial_repair_preinsert_normalize.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3815777f532fc2f846cc7b97731e308f6da0e454ae202277abb1d705c05d64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/op-orchestrator/src/validation_dump.rs:268-274 | crates/op-orchestrator/src/validation_fixes_apply.rs:560-566 \u2014 before extracting anything, compare \u0060crates/op-orchestrator/src/validation_dump.rs\u0060 and \u0060crates/op-orchestrator/src/validation_fixes_apply.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_dump.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"164d6db2c7914485ce4dd402c8216e5eec5433b4723047d1dcadf6cafee80813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AccountCenterOverlay.kt:149-163 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:328-343 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AccountCenterOverlay.kt:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AccountCenterOverlay.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e71c475e018ec131039317105ffb36d3caa909d6a427d157bbdf552a219fc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:74-89 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:165-180 \u2014 before extracting anything, compare \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt\u0060 and \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 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":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e9a1fd24fde0c53a47c653331b5c051f10fa2a6837970c3970b3a0a44630f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:120-135 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:207-221 \u2014 before extracting anything, compare \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt\u0060 and \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c658136346851c7c1e0f74a3e691a123cd106d2613e395ac3944a373450eb6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:174-189 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:239-254 \u2014 before extracting anything, compare \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt\u0060 and \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:174\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac53f93edc4e8c060c165cbde48b1421f7b7f095038b9e5512bc6535b9dca04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:98-109 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:188-198 \u2014 before extracting anything, compare \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt\u0060 and \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c6bcd4a05a9d9f87ac37c9b645b8079af72f5611ed2a50fd1d10d811e09f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:204-211 | packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt:306-313 \u2014 before extracting anything, compare \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt\u0060 and \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/NativeLoginOverlay.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt:204\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/android/app/src/main/kotlin/tech/zseven/openpencil/AuthCodeFormOverlay.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7763666be67c643567c2e0b44022ea0884675f7c69c57ff58efd10f1ac4ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_skincare.py:220-242 | templates/step0/_generators/tpl_tutorial_storage.py:215-239 \u2014 before extracting anything, compare \u0060templates/step0/_generators/tpl_tutorial_skincare.py\u0060 and \u0060templates/step0/_generators/tpl_tutorial_storage.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_skincare.py:220\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_skincare.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c68d27d8cbb965d1f562e276d49784aec3a26239bc9a6d97705625c18ac6672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_skincare.py:267-289 | templates/step0/_generators/tpl_tutorial_storage.py:277-299 \u2014 before extracting anything, compare \u0060templates/step0/_generators/tpl_tutorial_skincare.py\u0060 and \u0060templates/step0/_generators/tpl_tutorial_storage.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 121 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_skincare.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a9438f39ce038c61778bb9e4c7683c61d0a0d7e50a19149f61bba13bb35b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_photo.py:317-334 | templates/step0/_generators/tpl_tutorial_storage.py:231-252 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_photo.py:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_photo.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3329a04d7d72691724d975c76327eb635b9f8e100a10c18f3b5c349df5b1967a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_diy.py:302-322 | templates/step0/_generators/tpl_tutorial_report.py:270-290 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_diy.py:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_diy.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"898a404751ededda02bb302c5b7b38b4cd70edf6ec2840562224e205813d44ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): templates/step0/_generators/tpl_deck_dossier.py:164-183 | templates/step0/_generators/tpl_deck_ledger.py:159-177 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_deck_dossier.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22a75e779c8d572b31927d6dd8cf1bce2b292d0363de024a5cd212905f0cf91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_diy.py:161-180 | templates/step0/_generators/tpl_tutorial_workout.py:159-178 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_diy.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb73cfb623b29296a11d9297db7abd63348bb2a204fc110f91d4befb245cc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): templates/step0/_generators/tpl_cityguide_carousel.py:416-433 | templates/step0/_generators/tpl_toolkit_carousel.py:345-362 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_cityguide_carousel.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccfe84278072a7ac2525133192d4b7d606e11265f0bf052e5ba42da76688311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_skincare.py:172-188 | templates/step0/_generators/tpl_tutorial_storage.py:179-196 \u2014 before extracting anything, compare \u0060templates/step0/_generators/tpl_tutorial_skincare.py\u0060 and \u0060templates/step0/_generators/tpl_tutorial_storage.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 121 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":"templates/step0/_generators/tpl_tutorial_skincare.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5289c73cd2d1a60c9f131c7834e327cfdf7d0745e690d65d542fc46ea3434dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 8): templates/step0/_generators/tpl_infographic_challenge.py:252-265 | templates/step0/_generators/tpl_infographic_concept.py:301-317 | templates/step0/_generators/tpl_infographic_data.py:292-305 | templates/step0/_generators/tpl_infographic_faq.py:239-251 | templates/step0/_generators/tpl_infographic_map.py:248-264 | templates/step0/_generators/tpl_infographic_ranking.py:275-287 | templates/step0/_generators/tpl_infographic_steps.py:223-233 | templates/step0/_generators/tpl_infographic_timeline.py:274-286 \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 8 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060templates/step0/_generators/tpl_infographic_challenge.py:250\u0060 calls \u0060rect\u0060, \u0060solid\u0060 and \u0060templates/step0/_generators/tpl_infographic_concept.py:300\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_infographic_challenge.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"891434059c6552a4513e71d87a91b8fc719041c0c0db9c71f5873efb8feced6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): templates/step0/_generators/tpl_infographic_list.py:187-209 | templates/step0/_generators/tpl_tutorial_report.py:192-208 \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":"templates/step0/_generators/tpl_infographic_list.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa3b32dc3fea59223cf72081dd5f8e49bce43fb8b3c07070ca6495c9f5dbe11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_carousel.py:362-374 | templates/step0/_generators/tpl_yearreview_carousel.py:508-524 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_carousel.py:362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_carousel.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3242a7c0cea4cad75d405e334ca186391883ccd47fea5f00d0ef9c8ac958f9e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): templates/step0/_generators/tpl_tutorial_onboarding.py:117-132 | templates/step0/_generators/tpl_tutorial_recipe.py:117-129 | templates/step0/_generators/tpl_tutorial_software.py:132-146 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_onboarding.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"873469af28b32a2a233912357dcb6bb21359b8df9c5318f7ed9c131435e958d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): templates/step0/_generators/tpl_compare_do_dont.py:159-170 | templates/step0/_generators/tpl_journal_card.py:137-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_compare_do_dont.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84adccc02083f77002429f75caf57df6aa714d1341f50c55fe353dd065d7810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): templates/step0/_generators/tpl_qa_carousel.py:337-351 | templates/step0/_generators/tpl_yearreview_carousel.py:404-418 \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":"templates/step0/_generators/tpl_qa_carousel.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"82070d7d666ed586dd3ec17e6eed9671f5afcc1c664635b4aa833b1d8df22d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): templates/step0/_generators/tpl_compare_three_way.py:261-274 | templates/step0/_generators/tpl_infographic_list.py:234-245 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_compare_three_way.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee01e23c75a3415389ef086c4ac668a8fc03de484972f308d826216d5d551a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): templates/step0/_generators/tpl_tutorial_photo.py:335-347 | templates/step0/_generators/tpl_tutorial_skincare.py:276-288 | templates/step0/_generators/tpl_tutorial_storage.py:286-298 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060templates/step0/_generators/tpl_tutorial_skincare.py:275\u0060 calls \u0060stroke\u0060 and \u0060templates/step0/_generators/tpl_tutorial_photo.py:334\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_photo.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"22618a69f3d228d5bd1405ef9fa7ab2426fa0bef241130e0264504faec23402b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): templates/step0/_generators/tpl_toolkit_carousel.py:269-281 | templates/step0/_generators/tpl_tutorial_carousel.py:418-427 \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":"templates/step0/_generators/tpl_toolkit_carousel.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198f56beff377885854cdcaab1a22f8061ead45243a0ef15130acff4c91e206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_storage.py:229-242 | templates/step0/_generators/tpl_tutorial_workout.py:230-242 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_storage.py:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_storage.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8370116cc831e589c06225ec8e06e11e978c5585f52460ce64cf0e077a519da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): templates/step0/_generators/tpl2.py:171-182 | templates/step0/_generators/tpl3.py:105-116 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl2.py:171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl2.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4117ec66c02b4a38c6c32cce848a37d31ec5fad1f7ce6915f5c20aee5f3d8e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): templates/step0/_generators/tpl_infographic_ranking.py:211-222 | templates/step0/_generators/tpl_infographic_steps.py:184-196 \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":"templates/step0/_generators/tpl_infographic_ranking.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21e7fe3f43e872b9ea04ff7f7451794e2755d986f290c1df94bfcabeb795309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): templates/step0/_generators/tpl_lecture_light.py:86-97 | templates/step0/_generators/tpl_pitch_dark.py:105-116 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_lecture_light.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d43536ed9c42d85b7c8e46948487135409a2232458536516defceabb9246b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): templates/step0/_generators/tpl_datareport_carousel.py:305-315 | templates/step0/_generators/tpl_opinion_carousel.py:362-372 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_datareport_carousel.py:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_datareport_carousel.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f98311f0d766080fba9cfc730a65d35afb995c6fc1dd3d373bae001917a3a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): templates/step0/_generators/tpl_event_deck.py:109-119 | templates/step0/_generators/tpl_slides.py:67-77 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_event_deck.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96960bdb3e9e6e4efb78312d9316959920ab62b3baf73e06f4900f0cff644bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): templates/step0/_generators/tpl_infographic_list.py:228-238 | templates/step0/_generators/tpl_tutorial_diy.py:298-308 \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":"templates/step0/_generators/tpl_infographic_list.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c83ad6bf80a07faa42975eeedbb52c6cbf663be066c6574116b25e570e6a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_recipe.py:134-144 | templates/step0/_generators/tpl_tutorial_workout.py:157-167 \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":"templates/step0/_generators/tpl_tutorial_recipe.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bdf32ccdd32325a0c439ac48461f3e9f1a3fa9a11a928a7e6ccb14727d00f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): templates/step0/_generators/tpl_journal_card.py:191-200 | templates/step0/_generators/tpl_lecture_light.py:155-164 | templates/step0/_generators/tpl_pitch_dark.py:143-152 | templates/step0/_generators/tpl_quote_card.py:89-98 | templates/step0/_generators/tpl_quote_card.py:103-115 \u2014 there are 5 copies across 4 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 5 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060templates/step0/_generators/tpl_pitch_dark.py:136\u0060 calls \u0060neon_rule\u0060, \u0060rect\u0060, \u0060linear\u0060 and \u0060templates/step0/_generators/tpl_quote_card.py:85\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_journal_card.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56e3d3b39c93e79483b076128a08e7cdbcda510027782c072312b5684724e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): templates/step0/_generators/tpl2.py:172-181 | templates/step0/_generators/tpl3.py:106-115 | templates/step0/_generators/tpl_quote_card.py:126-139 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl2.py:172\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl2.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e996bf96d09c35806f9d8b6ec84ee50c67ca6df83dbf345e96ddbaf230a493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): templates/step0/_generators/tpl_gradient_tech.py:147-156 | templates/step0/_generators/tpl_pitch_dark.py:84-93 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_gradient_tech.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3723ef6abfb383b758e3225560ba285176ac13ba7122da9ad728a19ae889df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_skincare.py:244-252 | templates/step0/_generators/tpl_tutorial_storage.py:254-263 \u2014 before extracting anything, compare \u0060templates/step0/_generators/tpl_tutorial_skincare.py\u0060 and \u0060templates/step0/_generators/tpl_tutorial_storage.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_skincare.py:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_skincare.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b74eff3d5faa1f37cc6e468f569c40a5a35a9e453bb736b9305b62b98499343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): templates/step0/_generators/tpl_cards.py:87-95 | templates/step0/_generators/tpl_journal_card.py:192-201 | templates/step0/_generators/tpl_lecture_light.py:156-165 | templates/step0/_generators/tpl_pitch_dark.py:144-153 | templates/step0/_generators/tpl_quote_card.py:90-99 | templates/step0/_generators/tpl_quote_card.py:108-116 \u2014 there are 6 copies across 5 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 6 sites; resolving a subset leaves the remainder to drift apart. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_cards.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"78accbac3494052fd450e380a2594b575827d6477c27c665b5c503d2e1b349e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): templates/step0/_generators/tpl_tutorial_photo.py:316-324 | templates/step0/_generators/tpl_tutorial_skincare.py:219-226 | templates/step0/_generators/tpl_tutorial_storage.py:214-221 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_photo.py:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060templates/step0/_generators/tpl_tutorial_photo.py:326\u0060 calls \u0060col\u0060 and \u0060templates/step0/_generators/tpl_tutorial_skincare.py:228\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_photo.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7710b6ce4709f139c2654620b0f0e737ea2b9077047b75008fe69f44d863a9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): templates/step0/_generators/tpl_tutorial_photo.py:316-324 | templates/step0/_generators/tpl_tutorial_skincare.py:172-179 | templates/step0/_generators/tpl_tutorial_storage.py:179-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_photo.py:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060templates/step0/_generators/tpl_tutorial_photo.py:326\u0060 calls \u0060col\u0060 and \u0060templates/step0/_generators/tpl_tutorial_skincare.py:181\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_photo.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"042601dc490fea6a71ad9a79d7d402de016d2c29f61425e0f6e39d8fe64a7179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): templates/step0/_generators/tpl_deck_banxin.py:180-187 | templates/step0/_generators/tpl_deck_gridpaper.py:144-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_deck_banxin.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dff9ca105bf870571260b844e39ed0e79352325753b279548daf61894964d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): templates/step0/_generators/tpl_infographic_concept.py:191-200 | templates/step0/_generators/tpl_infographic_story.py:261-268 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_infographic_concept.py:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_infographic_concept.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"746d0475660b87cc91939ffe8410ec195f461014ca61a9cae7080a9f542c3dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): templates/step0/_generators/tpl_infographic_concept.py:286-294 | templates/step0/_generators/tpl_infographic_ranking.py:261-268 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_infographic_concept.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1925437e0400f7752dbaf3f907ac19c6baf44ecc79ee35f31f2d21c8c95a5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): templates/step0/_generators/tpl1.py:60-66 | templates/step0/_generators/tpl2.py:80-86 | templates/step0/_generators/tpl3.py:47-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl1.py:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl1.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef94a6ea84be6a740792de8911bdf41948c2e11b7427b33155ce8039bf622e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): templates/step0/_generators/tpl_deck_banxin.py:505-511 | templates/step0/_generators/tpl_deck_gridpaper.py:492-498 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_deck_banxin.py:505\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060index\u0060 to \u0060fill=solid(\u0022$c-ink\u0022))] for\u0060 in one and \u0060fill=solid(\u0022$c-blue\u0022))] for\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_deck_banxin.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d69e91bb4f254d52f3d6aa6791b88c52fba484f6313ca0e575ae3ea82f2ebf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): templates/step0/_generators/tpl_deck_banxin.py:143-151 | templates/step0/_generators/tpl_deck_gridpaper.py:123-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_deck_banxin.py:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_deck_banxin.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"29319e92a489a446da9339d55182a8908af536e0228cf984bc4dc405557eee57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): templates/step0/_generators/tpl_toolkit_carousel.py:377-382 | templates/step0/_generators/tpl_tutorial_carousel.py:343-348 \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":"templates/step0/_generators/tpl_toolkit_carousel.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3969c018a75facde0e149f48fc08d752e1ba1b8977ea1aa0782cda57eae69010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 5): templates/step0/_generators/tpl_bookreview_carousel.py:230-234 | templates/step0/_generators/tpl_cityguide_carousel.py:251-261 | templates/step0/_generators/tpl_opinion_carousel.py:211-215 | templates/step0/_generators/tpl_story_carousel.py:214-218 | templates/step0/_generators/tpl_yearreview_carousel.py:311-314 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060templates/step0/_generators/tpl_yearreview_carousel.py:311\u0060 calls \u0060frame\u0060 and \u0060templates/step0/_generators/tpl_opinion_carousel.py:210\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_bookreview_carousel.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba733cf497078a8bb382120834aeefc770cf8d819226640ef6d56bfa88bf641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): templates/step0/_generators/tpl_gradient_tech.py:204-208 | templates/step0/_generators/tpl_lecture_light.py:202-206 | templates/step0/_generators/tpl_pitch_dark.py:178-182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_gradient_tech.py:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060templates/step0/_generators/tpl_gradient_tech.py:211\u0060 calls \u0060mono\u0060, \u0060text\u0060 and \u0060templates/step0/_generators/tpl_lecture_light.py:210\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_gradient_tech.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d571d2e46a3c1b740979ba552e6377d0985aa193a9e54ea1269383b2e38ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl1.py:225-231 | templates/step0/_generators/tpl2.py:207-211 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl1.py:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl1.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7435d07ca7d86e333dba28123c64c46f9f4997b606086df41622d450f022f20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl_toolkit_carousel.py:228-232 | templates/step0/_generators/tpl_tutorial_carousel.py:268-284 \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":"templates/step0/_generators/tpl_toolkit_carousel.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"33731a08efbc694de5fc460eeb34981cdc0f5e9f6630d93a0ecdf38595d20472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_photo.py:143-147 | templates/step0/_generators/tpl_tutorial_skincare.py:132-136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/tpl_tutorial_photo.py:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_photo.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"508e8efd213a453038ce927d3d342d16a9d3a133036ceb6db6b65f4dc05b34ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): templates/step0/_generators/tpl1.py:70-79 | templates/step0/_generators/tpl2.py:90-99 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl1.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f57bb3cb117ff0806ce67a15ed526c489ca820a2c3c8bdb55915436b1e03ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl2.py:71-75 | templates/step0/_generators/tpl3.py:38-42 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl2.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3054cdc5c229a82fb5d7a294963d721ef1d08a7f2c6e6438b84cdb744003e7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 13): templates/step0/_generators/tpl_bookreview_carousel.py:137-141 | templates/step0/_generators/tpl_cityguide_carousel.py:151-155 | templates/step0/_generators/tpl_compare_myth_truth.py:122-126 | templates/step0/_generators/tpl_compare_scenario_guide.py:126-130 | templates/step0/_generators/tpl_compare_time_shift.py:118-122 | templates/step0/_generators/tpl_compare_tradeoff_scale.py:108-112 | templates/step0/_generators/tpl_datareport_carousel.py:142-146 | templates/step0/_generators/tpl_opinion_carousel.py:140-144 | templates/step0/_generators/tpl_qa_carousel.py:140-144 | templates/step0/_generators/tpl_story_carousel.py:142-146 | templates/step0/_generators/tpl_toolkit_carousel.py:144-148 | templates/step0/_generators/tpl_tutorial_carousel.py:139-143 | templates/step0/_generators/tpl_yearreview_carousel.py:189-193 \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 13 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_bookreview_carousel.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b22ab6bcf2d2759668d5a0fd055b60f3b68b651794162b32137fc87a1aeaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): templates/step0/_generators/tpl_bookreview_carousel.py:251-255 | templates/step0/_generators/tpl_cityguide_carousel.py:287-291 | templates/step0/_generators/tpl_datareport_carousel.py:217-221 | templates/step0/_generators/tpl_qa_carousel.py:268-272 | templates/step0/_generators/tpl_story_carousel.py:230-234 | templates/step0/_generators/tpl_toolkit_carousel.py:248-252 | templates/step0/_generators/tpl_tutorial_carousel.py:306-310 | templates/step0/_generators/tpl_yearreview_carousel.py:333-337 \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 8 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_bookreview_carousel.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c059cd2107abaee0b57eabd66540d83cc6ba241e6eac4379b9c3785b5cb98061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): templates/step0/_generators/tpl_brand_concept_sheet.py:54-58 | templates/step0/_generators/tpl_brand_concept_sheet.py:63-67 | templates/step0/_generators/tpl_logo_qa_board.py:98-102 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_brand_concept_sheet.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98fab8a4cfa2edf6d1cf862c9757e1501324cf74d4d62ad3b323f95c4f812a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 22): templates/step0/_generators/tpl_brand_concept_sheet.py:71-79 | templates/step0/_generators/tpl_compare_do_dont.py:136-143 | templates/step0/_generators/tpl_compare_myth_truth.py:130-137 | templates/step0/_generators/tpl_compare_pricing_tiers.py:122-129 | templates/step0/_generators/tpl_compare_scenario_guide.py:134-141 | templates/step0/_generators/tpl_compare_spec_table.py:154-161 | templates/step0/_generators/tpl_compare_three_way.py:141-148 | templates/step0/_generators/tpl_compare_time_shift.py:126-133 | templates/step0/_generators/tpl_compare_tradeoff_scale.py:116-123 | templates/step0/_generators/tpl_infographic_challenge.py:153-160 | templates/step0/_generators/tpl_infographic_concept.py:155-162 | templates/step0/_generators/tpl_infographic_data.py:121-128 | templates/step0/_generators/tpl_infographic_faq.py:150-157 | templates/step0/_generators/tpl_infographic_list.py:148-155 | templates/step0/_generators/tpl_infographic_map.py:150-157 | templates/step0/_generators/tpl_infographic_story.py:150-157 | templates/step0/_generators/tpl_infographic_timeline.py:151-158 | templates/step0/_generators/tpl_tutorial_photo.py:160-167 | templates/step0/_generators/tpl_tutorial_skincare.py:149-156 | templates/step0/_generators/tpl_tutorial_software.py:120-127 | templates/step0/_generators/tpl_tutorial_storage.py:156-163 | templates/step0/_generators/tpl_tutorial_workout.py:145-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 22 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_brand_concept_sheet.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e558c9a4bfba8838e1b52b8edec6337c418df99eb1483beb7288331dd7b74a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 39): templates/step0/_generators/tpl_card_daily.py:72-76 | templates/step0/_generators/tpl_card_metric.py:76-80 | templates/step0/_generators/tpl_card_metric.py:85-89 | templates/step0/_generators/tpl_card_notice.py:80-84 | templates/step0/_generators/tpl_card_notice.py:89-93 | templates/step0/_generators/tpl_card_price.py:83-87 | templates/step0/_generators/tpl_card_price.py:92-96 | templates/step0/_generators/tpl_card_quote.py:75-79 | templates/step0/_generators/tpl_card_spine.py:89-93 | templates/step0/_generators/tpl_compare_do_dont.py:119-123 | templates/step0/_generators/tpl_compare_do_dont.py:128-132 | templates/step0/_generators/tpl_compare_myth_truth.py:113-117 | templates/step0/_generators/tpl_compare_pricing_tiers.py:105-109 | templates/step0/_generators/tpl_compare_pricing_tiers.py:114-118 | templates/step0/_generators/tpl_compare_scenario_guide.py:117-121 | templates/step0/_generators/tpl_compare_spec_table.py:137-141 | templates/step0/_generators/tpl_compare_spec_table.py:146-150 | templates/step0/_generators/tpl_compare_three_way.py:116-120 | templates/step0/_generators/tpl_compare_three_way.py:125-129 | templates/step0/_generators/tpl_compare_time_shift.py:109-113 | templates/step0/_generators/tpl_compare_tradeoff_scale.py:99-103 | templates/step0/_generators/tpl_compare_version_diff.py:99-103 | templates/step0/_generators/tpl_compare_version_diff.py:108-112 | templates/step0/_generators/tpl_infographic_challenge.py:145-149 | templates/step0/_generators/tpl_infographic_concept.py:147-151 | templates/step0/_generators/tpl_infographic_data.py:104-108 | templates/step0/_generators/tpl_infographic_data.py:113-117 | templates/step0/_generators/tpl_infographic_faq.py:142-146 | templates/step0/_generators/tpl_infographic_list.py:131-135 | templates/step0/_generators/tpl_infographic_list.py:140-144 | templates/step0/_generators/tpl_infographic_map.py:142-146 | templates/step0/_generators/tpl_infographic_ranking.py:146-150 | templates/step0/_generators/tpl_infographic_steps.py:116-120 | templates/step0/_generators/tpl_infographic_steps.py:125-129 | templates/step0/_generators/tpl_infographic_story.py:142-146 | templates/step0/_generators/tpl_infographic_timeline.py:143-147 | templates/step0/_generators/tpl_journal_card.py:124-128 | templates/step0/_generators/tpl_tutorial_software.py:103-107 | templates/step0/_generators/tpl_tutorial_software.py:112-116 \u2014 there are 39 copies across 27 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 39 sites; resolving a subset leaves the remainder to drift apart. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_card_daily.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"424ba095aebdeeb8a56be70c188cc3e72922dfc1e7b67afa893bb129ef54f107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): templates/step0/_generators/tpl_cityguide_carousel.py:438-448 | templates/step0/_generators/tpl_opinion_carousel.py:413-426 | templates/step0/_generators/tpl_story_carousel.py:431-443 | templates/step0/_generators/tpl_yearreview_carousel.py:544-554 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_cityguide_carousel.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eb39143682a1256c18e421b8ed8a35eb54da07ee6d78d09e6c4b0c154823c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): templates/step0/_generators/tpl_cityguide_carousel.py:462-479 | templates/step0/_generators/tpl_toolkit_carousel.py:434-455 | templates/step0/_generators/tpl_yearreview_carousel.py:569-585 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_cityguide_carousel.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1353efa59befcf107dd5f52def6e7faf84baa9aedba212aad5845969d2450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): templates/step0/_generators/tpl_compare_do_dont.py:276-289 | templates/step0/_generators/tpl_compare_pricing_tiers.py:230-243 | templates/step0/_generators/tpl_compare_time_shift.py:212-225 | templates/step0/_generators/tpl_compare_tradeoff_scale.py:197-210 | templates/step0/_generators/tpl_compare_version_diff.py:178-191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_compare_do_dont.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"965a701e5feb77405a1a7faaa227c68cab11100ab36a1d30b6a6d3fa1647f9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): templates/step0/_generators/tpl_compare_myth_truth.py:104-108 | templates/step0/_generators/tpl_compare_scenario_guide.py:108-112 | templates/step0/_generators/tpl_compare_spec_table.py:128-132 | templates/step0/_generators/tpl_compare_three_way.py:133-137 | templates/step0/_generators/tpl_tutorial_workout.py:137-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 all 5 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_compare_myth_truth.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8df6bd0c51b4f7570fc88a324bd70170f431e72f9bfaa12b3169f81a56d76f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): templates/step0/_generators/tpl_compare_myth_truth.py:152-159 | templates/step0/_generators/tpl_compare_scenario_guide.py:156-163 | templates/step0/_generators/tpl_compare_spec_table.py:176-184 | templates/step0/_generators/tpl_compare_three_way.py:163-170 | templates/step0/_generators/tpl_infographic_challenge.py:176-183 | templates/step0/_generators/tpl_infographic_concept.py:178-185 | templates/step0/_generators/tpl_infographic_data.py:145-152 | templates/step0/_generators/tpl_infographic_faq.py:189-196 | templates/step0/_generators/tpl_infographic_list.py:171-178 | templates/step0/_generators/tpl_infographic_map.py:173-180 | templates/step0/_generators/tpl_infographic_steps.py:159-166 | templates/step0/_generators/tpl_infographic_steps.py:238-246 \u2014 there are 12 copies across 11 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 12 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_compare_myth_truth.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"01631483dbea93c9078a37f760e12b24570a415dedca1163191be4b2e77a02d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): templates/step0/_generators/tpl_compare_scenario_guide.py:184-190 | templates/step0/_generators/tpl_compare_spec_table.py:205-211 | templates/step0/_generators/tpl_infographic_concept.py:230-238 | templates/step0/_generators/tpl_infographic_steps.py:251-259 | templates/step0/_generators/tpl_infographic_story.py:204-212 | templates/step0/_generators/tpl_infographic_story.py:278-293 | templates/step0/_generators/tpl_tutorial_workout.py:274-279 \u2014 there are 7 copies across 6 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 7 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_compare_scenario_guide.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb8e2b28a8204ff3a40d22a9e410c644f9775f5092f3607dcfef9c9f3ed6f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): templates/step0/_generators/tpl_infographic_challenge.py:127-132 | templates/step0/_generators/tpl_infographic_concept.py:129-134 | templates/step0/_generators/tpl_infographic_data.py:94-99 | templates/step0/_generators/tpl_infographic_faq.py:124-129 | templates/step0/_generators/tpl_infographic_list.py:121-126 | templates/step0/_generators/tpl_infographic_map.py:124-129 | templates/step0/_generators/tpl_infographic_ranking.py:128-133 | templates/step0/_generators/tpl_infographic_steps.py:106-111 | templates/step0/_generators/tpl_infographic_story.py:124-129 | templates/step0/_generators/tpl_infographic_timeline.py:125-130 \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 10 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_infographic_challenge.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"68495489decc3b6aa4f31d81797b3d463171cf417ec5b6b46cb7bdfba1f0d234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): templates/step0/_generators/tpl_infographic_ranking.py:198-206 | templates/step0/_generators/tpl_infographic_timeline.py:175-183 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_infographic_ranking.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b49a0eb07b5bb486ec95ffa58a626e6764d094ff494f0a47b02a453074b5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl_lecture_light.py:117-121 | templates/step0/_generators/tpl_pitch_dark.py:121-125 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_lecture_light.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a9301ce73fac19c1f57df23e638194907d2d56e916b3af8fac1c28a3a5e4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_diy.py:128-132 | templates/step0/_generators/tpl_tutorial_report.py:131-135 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_diy.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6971b125d9347e77b84fb21cf97fc58e94870c3c9a2bdf0fa7148cf4b01c0ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/step0/_generators/tpl_tutorial_skincare.py:293-297 | templates/step0/_generators/tpl_tutorial_storage.py:303-307 \u2014 before extracting anything, compare \u0060templates/step0/_generators/tpl_tutorial_skincare.py\u0060 and \u0060templates/step0/_generators/tpl_tutorial_storage.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 121 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_tutorial_skincare.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"438ce065f045f9c186c5b064f0ca4064c839a3d8d4abf0df6f6444b175136285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): templates/step0/_generators/tpl_card_metric.py:112-126 | templates/step0/_generators/tpl_card_notice.py:134-149 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/tpl_card_metric.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e1a3cdf8ace8c20eac1ddb6a8e926686d10d72ac5ec48ad69ea5715ff00300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): templates/step0/_generators/deck_sounding_navy.py:122-127 | templates/step0/_generators/deck_tidemark_slate.py:114-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060templates/step0/_generators/deck_sounding_navy.py:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/deck_sounding_navy.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9442df9a524438ee64b055dc59cad2f35368faef9e012b89b732a5b0db8a37d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 2): packaging/ios/Sources/AuthCodeFormViewController.swift:68-110 | packaging/ios/Sources/NativeLoginViewController.swift:102-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/AuthCodeFormViewController.swift:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"310c417eac7d04aa86d068a78489d709607fcc754b9ab86a4a74f840bde92dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): packaging/ios/Sources/DocumentExportCoordinator.swift:150-169 | packaging/ios/Sources/DocumentSaveCoordinator.swift:319-338 \u2014 before extracting anything, compare \u0060packaging/ios/Sources/DocumentExportCoordinator.swift\u0060 and \u0060packaging/ios/Sources/DocumentSaveCoordinator.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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":"packaging/ios/Sources/DocumentExportCoordinator.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"30860a48d4604a46bc1ecb039b80c875619c43150a7e91910d247fa52fc4d746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 4): packaging/ios/Sources/DocumentExportCoordinator.swift:249-262 | packaging/ios/Sources/DocumentSaveCoordinator.swift:401-414 | packaging/ios/Sources/ImageImportCoordinator.swift:169-186 | packaging/ios/Sources/OpPlayerView.swift:391-403 \u2014 before extracting anything, compare \u0060packaging/ios/Sources/DocumentExportCoordinator.swift\u0060 and \u0060packaging/ios/Sources/DocumentSaveCoordinator.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/DocumentExportCoordinator.swift:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/DocumentExportCoordinator.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a41816cef95d17c4965654c0232d6c81c782639b9c89263a1e3654ef7d920d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): packaging/ios/Sources/AuthCodeFormViewController.swift:164-180 | packaging/ios/Sources/NativeLoginViewController.swift:183-195 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/NativeLoginViewController.swift:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8008435cece97b389d6dc6e41377e1c3abd9bf902c4f2040f04efe58077d2f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packaging/ios/Sources/NativeLoginViewController.swift:638-653 | packaging/ios/Sources/UpdateChecker.swift:83-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/NativeLoginViewController.swift:638\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/NativeLoginViewController.swift"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"97479255170c1fd7027897b0df1c71a6bb7fa57841be3cc3b6b4115eb2d114d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): packaging/ios/Sources/AuthCodeFormViewController.swift:201-215 | packaging/ios/Sources/NativeLoginViewController.swift:220-234 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/AuthCodeFormViewController.swift:201\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"348939fd68035413f0dcd25fdb38d1d4dc0006f532d697ed0530985daa3a7463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): packaging/ios/Sources/AccountCenterViewController.swift:229-240 | packaging/ios/Sources/NativeLoginViewController.swift:644-655 | packaging/ios/Sources/UpdateChecker.swift:89-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/AccountCenterViewController.swift:229\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/AccountCenterViewController.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4b9154a486b55ed21cedeef3fa3795e548ab2662eb4a1f0186dbab73ea93f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packaging/ios/Sources/SsoAuthClient.swift:114-124 | packaging/ios/Sources/SsoAuthClient.swift:261-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/SsoAuthClient.swift:114\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060completion\u0060 to \u0060@escaping (Result\u003CString, SsoAuthError\u003E) -\u003E Void\u0060 in one and \u0060@escaping (Result\u003CVoid, SsoAuthError\u003E) -\u003E Void\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/SsoAuthClient.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"96140a61b1fd03230dec7297656b440b3b948798f65ffec50e4184b98f95e152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packaging/ios/Sources/SsoAuthClient.swift:181-191 | packaging/ios/Sources/SsoAuthClient.swift:196-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/SsoAuthClient.swift:181\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/SsoAuthClient.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1827c0ce1bd620a532534f939c5081a1fff40ec679cc24cb9bbbd0bca5943f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packaging/ios/Sources/AuthCodeFormViewController.swift:465-470 | packaging/ios/Sources/NativeLoginViewController.swift:390-396 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/ios/Sources/AuthCodeFormViewController.swift:465\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65191accc943ab96482a49c55b37bcec20745c493d177c6fb1ed65890c95ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packaging/ios/Sources/AuthCodeFormViewController.swift:337-346 | packaging/ios/Sources/NativeLoginViewController.swift:366-375 \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":"packaging/ios/Sources/AuthCodeFormViewController.swift"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9da65785c77d5ab5123cf2b8de887f573394410f3b9edef30442e25b445bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packaging/ios/Sources/DocumentExportCoordinator.swift:268-275 | packaging/ios/Sources/DocumentSaveCoordinator.swift:420-427 \u2014 before extracting anything, compare \u0060packaging/ios/Sources/DocumentExportCoordinator.swift\u0060 and \u0060packaging/ios/Sources/DocumentSaveCoordinator.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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":"packaging/ios/Sources/DocumentExportCoordinator.swift"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8c37b1cde7c286cebb66f805aa69474e2d0fbd10c802888c364923ad40e482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packaging/ios/Sources/DocumentSaveCoordinator.swift:238-243 | packaging/ios/Sources/ImageImportCoordinator.swift:137-142 \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":"packaging/ios/Sources/DocumentSaveCoordinator.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea33302021b677d328fadb4ad3604923216d65990a255cc5abd32d171d5021ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 15 shared lines): crates/op-preview-core/src/tests_animation.rs:42-59 | crates/op-preview-core/src/tests_debug_controls.rs:82-99 | crates/op-preview-core/src/tests_debug_trace.rs:69-89 | crates/op-preview-core/src/tests_effects.rs:219-238 | crates/op-preview-core/src/tests_ui_actions.rs:29-47 \u2014 These 5 members are variants of one another: a block of 15 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 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":"crates/op-preview-core/src/tests_animation.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1a4e0c32beba89e3b084659ebbaadf5b90f8c22c0086f8e2df2309b8f7a60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 5): crates/op-preview-core/src/tests_animation.rs:43-57 | crates/op-preview-core/src/tests_debug_controls.rs:83-97 | crates/op-preview-core/src/tests_debug_trace.rs:70-84 | crates/op-preview-core/src/tests_effects.rs:220-234 | crates/op-preview-core/src/tests_ui_actions.rs:30-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/tests_animation.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dd62164df54353c087d696b35bbf89fd77addcc98f0f890c1279bda00a5564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/op-orchestrator/src/run_tests_b4.rs:46-60 | crates/op-orchestrator/src/run_tests_b4.rs:67-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_tests_b4.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57dc76b084db0d6eb6b0656b12c2abf4215b68a9b1a1413fe8a9b2b3e5038fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-preview-core/src/tests_interaction_state.rs:54-58 | crates/op-preview-core/src/tests_pointer_bindings.rs:35-39 \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":"crates/op-preview-core/src/tests_interaction_state.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6afc8968eb7c7f1e95bdfa86b4f59a5c6595726b56d2f491f571958773929f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/op-preview-core/src/tests_event_payloads.rs:57-61 | crates/op-preview-core/src/tests_input_trace.rs:40-44 \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":"crates/op-preview-core/src/tests_event_payloads.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"65db8788ca268d21608a230a102d4f5b743a38039e704d0e99baf53f91714bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/op-preview-core/src/tests_binding_overlay.rs:230-242 | crates/op-preview-core/src/tests_device_frame.rs:18-30 \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":"crates/op-preview-core/src/tests_binding_overlay.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7602db5e3301e554499d132cad8d3bffde050e735cf789e60ebe9eac7234a04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/op-preview-core/src/tests_binding_overlay.rs:13-18 | crates/op-preview-core/src/tests_pointer_bindings.rs:41-46 \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":"crates/op-preview-core/src/tests_binding_overlay.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d585738e8e5ccd90d472c4ff928c8353d0c533af2bcaa771ab73f9aace3ecb46"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project op-engine-ffi: op-engine-ffi has instability 0.89 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"af61b13a6cce1766c87f83f07a2df60366ff903e6547dc7cd4c3a21b94cc25de"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project op-host-web: op-host-web has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"74ebc40ca4a94696d2b386b129f4e7f095cabb2b80d246395b10952d41614881"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @zseven-w/op-web-sdk: @zseven-w/op-web-sdk: 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":"ac9a04e8b32b133287765fbce10f3a78caab618b6ba00b64dd8f8fd2c7ac673a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-config-store: op-config-store: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"584042fbde68480643770a649df0fa3e0892a4eef59ff34a064fd87a642a2276"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-figma: op-figma: 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":"4fc7337f43f2f5710d52a0b5121248d44d0d19db4ff5f03d448f2989a36cb913"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-i18n: op-i18n: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"43c77dcf964ce304c7dfc2ebc49b4cc7d35ba6923cca1e417b3d07ea6e0b8d9d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-opmerge: op-opmerge: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c34c4d5a880e4bfc0b9c4d80582c7fa89121a0773e6fb5d3df92f4c8ad0bc39"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-preview-contracts: op-preview-contracts: abstractness 0.00, instability 0.00, distance 1.00 \u2014 the shape a shared-kernel / building-block library has BY DESIGN \u2014 concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"955d99de5e21230d4c38a7784cae369b7a91e660df2d173e604ef22040c324ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-process-io: op-process-io: 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":"47de23bcf3ad078cdddc07384dfce68905269a48f882cb27b04e443155fdb74c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-rpc-transport: op-rpc-transport: 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":"e020826043d94fd4da03c1c6ad6ccf6a24bb5a021f7d3d5b37051b3442e953aa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-util: op-util: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50d2b40b908f87f0ec2d6fd8e3c88d357a1f4725f63f56ce79487d742358c5a5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-collab-relay-protocol: op-collab-relay-protocol: abstractness 0.04, instability 0.00, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d89799e98fb43fa69f46da28f90d82f6bb2a257fcc6cc63031317b87bdc6b399"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-auth-bridge: op-auth-bridge: abstractness 0.05, instability 0.00, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5c0ef6a7f348dcf71a94a68e11f7a9003399fca4bc0727eff1f07d19167a667d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-ai-skills: op-ai-skills: abstractness 0.00, instability 0.09, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c396d9d1670ec1714b4586f818413246c65a382cc550e9f9dddfe14022c8b011"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-ai: op-ai: abstractness 0.10, instability 0.00, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ced5f5bbf313af893612c264f6a1648567105956de357d1c940c256f6c58a959"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-pen-loader: op-pen-loader: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4474433b1b87b9f77153a6d846c822858397b35a7482d8f39605d3b6cd80b6a2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-editor-core: op-editor-core: abstractness 0.01, instability 0.13, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a502576fb770ec99c6b8314d4fdd1ccd2de953bb132e9fe9bf247973a0a4d897"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-html: op-html: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0b675b7380b0bcc7d05cbc17e185e58712c057253b43a89dca2d2421d4c8b214"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-collab: op-collab: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aa471da2ae3bf7ce02da311e04ae7a434d566e2def89db53a45e9503157de348"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-design-lint: op-design-lint: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3b20d99db5ded2869b6b2f72779c6e4040f310d04ec8456d104395cce24908be"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-collab-transport: op-collab-transport: abstractness 0.05, instability 0.20, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"636f54ef9cd1d498a168da21d053d72aa88f0722a4553e64f73b0f606a46f6d5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: op-editor-ui: op-editor-ui: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44d7e960e4a5327bf59d21957f32f11ceea04c2793a03aec7db9c77b9fd99fa5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NativeBackend (LCOM4 28): NativeBackend\u0027s methods fall into 28 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 28 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":"crates/op-host-native/src/backend/skia.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dddcc0f8479ccdf858c6ec6aaab902a5f1c9310f0998a67126768a16e33fff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AgentSettings (LCOM4 6): AgentSettings\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/agent_settings.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bd4c6652e06a7ec97331552b2aebb366902b661f1b2f68dfdb78e9939361fc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ConfiguredBuiltinProvider (LCOM4 5): ConfiguredBuiltinProvider\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_builtin_http.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b92da9c1a416a34ded2007f815b9f59405467fae0eed8365ffe12d120c248"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RealCollabTicketProvider (LCOM4 4): RealCollabTicketProvider\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":"crates/op-auth-bridge/src/real_collab_ticket.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a402d452ff6614dcb48c9edcd2120f111ad97c70fd8c951399e414d3af0d8d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChatState (LCOM4 4): ChatState\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":"crates/op-editor-core/src/chat.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265c0c7d19c7d042c5717297f939158562b77ebffab5ec532b7c1b420d4c742"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EditorState (LCOM4 4): EditorState\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":"crates/op-editor-core/src/state.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaa1e95ac55d06dc806233185f49ae2463a84613f0545f4ce1b02b9ac2e1b53"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChatSession (LCOM4 4): ChatSession\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":"crates/op-editor-host-core/src/chat.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b297bb771de2e85045252cb73dd3122e1fbb1f720db6cdd4ef4b814908d371"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VariablesPanel (LCOM4 4): VariablesPanel\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":"crates/op-editor-ui/src/widgets/variables_panel.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"07152f25f2f9548843c9c8dc449e96fb5056212cea77b2811ef7f4547a693a4c"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 packages/op-web-sdk/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/op_ck_bridge.js: crates/op-host-web/src/op_ck_bridge.js changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 366 in op_ck_bridge.opCkInit at line 308. 8 of those changes were fix/bug commits, and the other 10 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/op_ck_bridge.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e215a6e3ccfdeed0dc6f0697ef25486b2b1db135872adf443f2a32bbabb23c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/keyboard_input.rs: crates/op-host-desktop/src/keyboard_input.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in DesktopApp::handle_key_pressed at line 15. 10 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/keyboard_input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/keyboard_input.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fe3eec1c585ebd9df17f707fb1a103df07410a5e20b4aef29c624cd192cae8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/paint.rs: crates/op-host-native/src/widget_host/paint.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in WidgetHostNative::paint at line 19. 5 of those changes were fix/bug commits, and the other 37 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a067bb67a41ec49bcb39a0fccf49675bcc2a42520a88029462f9e8f345b802"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/cursor_input.rs: crates/op-host-web/src/widget_host/cursor_input.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 148 in WidgetHost::apply_cursor_move at line 17. 4 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/cursor_input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/cursor_input.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc870c2aea6ef431b999da14cc04ff811bbf22da2fccf0cd00c8e7f883c3576b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs: crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in op_editor_ui::widgets::canvas_viewport_paint::paint_node_inner at line 118. 10 of those changes were fix/bug commits, and the other 20 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_paint.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc1fcfbd762fc7568f2ec53cedb85db2c7ee35f7d4696635b206a088df0e752"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/command_apply.rs: crates/op-editor-core/src/command_apply.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 177 in EditorState::apply_with_allocator at line 55. 4 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/command_apply.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command_apply.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"87057aee6f97ffbc4cc91aa5bcf0ed917ffc9ab9eac1f08d9763e0023690d5c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/icons.rs: crates/op-editor-ui/src/widgets/icons.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in Icon::paths at line 294. 2 of those changes were fix/bug commits, and the other 11 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/icons.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/icons.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b709e534753ee5533549147c00100a92d39635716c2a6a86bc6b90e539696c6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/press.rs: crates/op-host-native/src/widget_host/press.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in WidgetHostNative::apply_press_inner at line 201. 4 of those changes were fix/bug commits, and the other 27 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/press.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbef844eb44f5cbed0bfef7ff685697e426b514823b7b589dbb163fe747b2d28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/paint.rs: crates/op-host-web/src/widget_host/paint.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in WidgetHost::paint_editor at line 49. 5 of those changes were fix/bug commits, and the other 25 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/paint.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad3c43cab301fa72051209dc456c5d7dbd143155179a23be11c183f9515635"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/web_canvas_server.rs: crates/op-host-services/src/web_canvas_server.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in op_host_services::web_canvas_server::handle_web_canvas_request at line 460. 8 of those changes were fix/bug commits, and the other 26 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88b3a443cfcd903744cfaa28b35925cfabd3bec1c04a8f5d63a0e23d91f51f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs: crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in AIChatPlaceholder::hit_test_with_canonical at line 60. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595db9cc970c2f30df5b0d93229c97b53cfbbb0c3f5273cf4f3549651324510"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/app_handler.rs: crates/op-host-desktop/src/app_handler.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in DesktopApp::window_event at line 435. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/app_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":"crates/op-host-desktop/src/app_handler.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a675198e47f3b1d4eff592822573a530e7ebd6bd5a843013ec9f94fe3f62e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/scroll.rs: crates/op-host-native/src/widget_host/scroll.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in WidgetHostNative::apply_wheel_inner at line 475. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/scroll.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/scroll.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe536cbbc24298592fccb06422697bdd89a1c4064e5e3a728bcd4866528d7d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/mcp_serve.rs: crates/op-host-services/src/mcp_serve.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in op_host_services::mcp_serve::read_http_request at line 403. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/mcp_serve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37ac8c3369de0bd4e93c79bc81b4dede5d0564058703ce3b3ee49c759f80243"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/persistence.rs: crates/op-host-desktop/src/persistence.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in op_host_desktop::persistence::run_action at line 372. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/persistence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/persistence.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a2d8c6613a5bb88c6b6c74105eb3812a97105c38ddc96506778f3c4aba7ea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/keyboard.rs: crates/op-host-native/src/widget_host/keyboard.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in WidgetHostNative::apply_text at line 16. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/keyboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecd620aa395225d8100c1238f05e810b1cdd963086811fe378e95228bea616a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/app_handler/redraw.rs: crates/op-host-desktop/src/app_handler/redraw.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in DesktopApp::on_redraw_requested at line 35. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/app_handler/redraw.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/redraw.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1123660c5eabda59403690f63e625e5ed8a473ced458396dd3190462632be72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/web_canvas_server/connection.rs: crates/op-host-services/src/web_canvas_server/connection.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in op_host_services::web_canvas_server::connection::dispatch at line 101. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b02ff456d1e69d437e17b68d99f5cda6af8cfc5040abefa36e2180309b23faa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-smoke/src/main.rs: crates/op-smoke/src/main.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in op_smoke::main at line 214. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-smoke/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/main.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37a66fde3c912ef9a19d7bab21b4fbe9814619113516ba393c738902a853403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/input.rs: crates/op-host-native/src/widget_host/input.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in WidgetHostNative::apply_node_drag_cursor_move at line 208. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/input.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a7792421133d55f03865b19c1c3f21fbf8cae7926a4efdb13839d88169e602"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-cli/src/main.rs: crates/op-cli/src/main.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in op_cli::command_from_positionals at line 366. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-cli/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/main.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3050bf4d7c51889beee8a2cc0c28287d88898470390b8f5f8a8309cdf03f80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/canvaskit/mount.rs: crates/op-host-web/src/canvaskit/mount.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in op_host_web::canvaskit::mount::mount_ck at line 14. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/canvaskit/mount.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/mount.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf283e32feca4a3ce8f9a05a5b3b4f33d993a50d697ad27770aebe210f4448"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/chat_subprocess.rs: crates/op-host-services/src/chat_subprocess.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in SubprocessProvider::send_inner at line 280. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_subprocess.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc842f8e84a95da81ea75cf5d0add596fa3dbc651b24850061ba85854b882a37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/keyboard_escape.rs: crates/op-host-native/src/widget_host/keyboard_escape.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in WidgetHostNative::apply_escape at line 13. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/keyboard_escape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_escape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e16e14a5a4aa22dc12febf19124da5f49503e99c94d8fe238622a96f2926771"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/scene_template_catalog.rs: crates/op-editor-core/src/scene_template_catalog.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in op_editor_core::scene_template_catalog::scene_template_document_route at line 62. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/scene_template_catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/scene_template_catalog.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4062926ab5e1e31a539388aaf6adfe800cd4cee2e4e6d9ba4f409bcc5fd5c7b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_dispatch.rs: crates/op-editor-ui/src/widgets/property_panel_dispatch.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in op_editor_ui::widgets::property_panel_dispatch::apply_property_action 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_dispatch.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bfb2f2db619130162049219ac4006f864bec1a0614d03c0481ca7b121c4425"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/prompt_subagent.rs: crates/op-orchestrator/src/prompt_subagent.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in op_orchestrator::prompt_subagent::build_subagent_prompt_core_with_outcomes at line 148. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/prompt_subagent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/prompt_subagent.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee1aa4ce8bf197e3a190baa31be7835bc8754bd5d381f1f00581ec6b13021c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/canvas_viewport.rs: crates/op-editor-ui/src/widgets/canvas_viewport.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in CanvasViewport::paint at line 165. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b06831e0544f1c486aec940037c3b46b54ca697e97e1864f72b3d72345fc83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/subagent.rs: crates/op-orchestrator/src/subagent.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in op_orchestrator::subagent::run_subtask_with_reveal_at_and_outcomes at line 118. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/subagent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/subagent.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9203401cf54d0cf6e5adbc664a8f8e211b44da3b5b034949970e7424b8400cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/keyboard_delete.rs: crates/op-host-native/src/widget_host/keyboard_delete.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in WidgetHostNative::apply_backspace at line 13. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/keyboard_delete.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_delete.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"98364f053efd26c13ec6047aa347497774567ade27aa4a7acf4ebeb569a29cfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/chat_session_launch.rs: crates/op-host-desktop/src/chat_session_launch.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in op_host_desktop::chat_session_launch::launch_if_pending_inner at line 100. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/chat_session_launch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session_launch.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1db1d80270502871e67dd6b8e757f154533583b459b717760bbf474d782c816"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/instance.rs: crates/op-figma/src/instance.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in op_figma::instance::apply_instance_overrides_cached at line 102. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/instance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5734181f263867257cbaf1095b68b3a93e10674c0a5baa7ee3d579567daf51ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/run_orchestrator.rs: crates/op-orchestrator/src/run_orchestrator.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Orchestrator::run at line 23. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/run_orchestrator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_orchestrator.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ae51744a90cdfb6b2184699a865a890b2ebc9af18af88aae399ecdc50b236a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/keyboard_escape.rs: crates/op-host-web/src/widget_host/keyboard_escape.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in WidgetHost::apply_escape at line 16. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/keyboard_escape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_escape.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"42984a7a3e70209be2d85c9988805fda73f3a8dff81ae41c7a458477e24d9fa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/loop_finalize.rs: crates/op-orchestrator/src/loop_finalize.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in op_orchestrator::loop_finalize::fix_theme_variable_polarity at line 230. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/loop_finalize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/loop_finalize.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ebfcca1ebfd75d956e9164df4199688acf22293931a30c8ad2c25874fe67d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/scene_template_previews.rs: crates/op-editor-ui/src/widgets/scene_template_previews.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in op_editor_ui::widgets::scene_template_previews::scene_template_preview at line 80. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/scene_template_previews.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_previews.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba56cc29229a199d49ace2a499de326857ae7e1d8980c3cac00a9c3ff301113"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/keyboard_send.rs: crates/op-host-native/src/widget_host/keyboard_send.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in WidgetHostNative::apply_send at line 10. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/keyboard_send.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/keyboard_send.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"665730a88a9bbd6a144a0c3ee2d7add9598a28367e5e71fa3bd1c1e1100408d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/top_bar.rs: crates/op-editor-ui/src/widgets/top_bar.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TopBar::hit_test_with_git_rect at line 401. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/top_bar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"152006729ff70e96e714705a1aeacbba6793c80aced85cf925c1c1d3914c22e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/design_session.rs: crates/op-host-desktop/src/design_session.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in op_host_desktop::design_session::apply_progress at line 312. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/design_session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"367702464c35b3b062d4c2eb2f8421c56417e6473f7cad625de54ae3a89ba3dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_layout.rs: crates/op-editor-ui/src/widgets/property_panel_layout.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in op_editor_ui::widgets::property_panel_layout::action_button_rects_with_fill_picker at line 213. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_layout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_layout.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6523700a80ac217cac4421952dc35078b58eb054a4b2179048d6c80f0225bc8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/agent_settings_builtin.rs: crates/op-editor-ui/src/widgets/agent_settings_builtin.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in op_editor_ui::widgets::agent_settings_builtin::hit_test_with_touch at line 117. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/agent_settings_builtin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_builtin.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"94476fd0b9e567647f23af6951c3581ee0f00c8d5b65e7048a4ee95ce1960467"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/menu_action.rs: crates/op-host-desktop/src/menu_action.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in DesktopApp::handle_menu_action at line 68. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/menu_action.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/menu_action.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a6b2aba7b6108760542fa1c89ea469ca3a3c01fabd275e4091fef67c0e2ee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/layer_panel.rs: crates/op-editor-ui/src/widgets/layer_panel.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in LayerPanel::paint at line 394. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/layer_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5871c2c73f8e271706190b9e1224880d0d5274becfc3fe42fa22ea0063761b33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/ai_chat_transcript.rs: crates/op-editor-ui/src/widgets/ai_chat_transcript.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in op_editor_ui::widgets::ai_chat_transcript::build_item at line 178. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/ai_chat_transcript.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeb7d2c05b5fb049bb1c4ed886824005ef245b90c9a12b5855d3acd6d8b607d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/press_chrome_tiers.rs: crates/op-host-native/src/widget_host/press_chrome_tiers.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in WidgetHostNative::press_mobile_more_sheet_tier at line 561. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/press_chrome_tiers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa82b75fdf4ca07c4d547939c71e1b67515a2830519cccd760853c4d8f0279cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/keyboard.rs: crates/op-host-web/src/widget_host/keyboard.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in WidgetHost::apply_backspace at line 133. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/keyboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9d7a37382bd371669eba1b24e97593d43a607e002bceb28bfd71f951fe4acb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/canvas_viewport_image.rs: crates/op-editor-ui/src/widgets/canvas_viewport_image.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in op_editor_ui::widgets::canvas_viewport_image::paint_image_node_with_stroke at line 409. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport_image.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_image.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffd69edbacd072c98393d4a8e8e4a09cf3f5b308e0c939fdba31226e9e80d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/press.rs: crates/op-host-web/src/widget_host/press.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WidgetHost::apply_press at line 130. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/press.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d7511bbd246dfff692eb5c28544726d7dd9c2a1c0efd17d6866c7325de984c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/chat_builtin_http.rs: crates/op-host-services/src/chat_builtin_http.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ConfiguredBuiltinProvider::send_inner at line 257. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_builtin_http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_builtin_http.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f8732e1abb9b8ef7702a70691c39c461959ac2f1bc4126a9b29168ddfbc38d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_input_layout.rs: crates/op-editor-ui/src/widgets/property_panel_input_layout.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in op_editor_ui::widgets::property_panel_input_layout::editable_input_rects 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_input_layout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_input_layout.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ede272e32d063fb20517c0e18496bcc7b74bd8982986ccfc76166d7d95599"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/mcp_serve/registry.rs: crates/op-host-services/src/mcp_serve/registry.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 143 in op_host_services::mcp_serve::registry::rebuild_registry at line 9. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/mcp_serve/registry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/registry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9906b5f50e9f5f3783a53f18531136c734ccdd38b8abaf0d36049e9cdbc526b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/overlay_cursor.rs: crates/op-host-web/src/widget_host/overlay_cursor.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in WidgetHost::apply_overlay_cursor_move at line 96. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/overlay_cursor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/overlay_cursor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91978ca684a7df26988b6178f8926377119d3b80d24fc9f2a6ab2b8aa287797"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/chat_click_flow.rs: crates/op-editor-ui/src/widgets/chat_click_flow.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in op_editor_ui::widgets::chat_click_flow::apply_chat_hit at line 84. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/chat_click_flow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/chat_click_flow.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5a2fe2da6a3b399a83ef0e61519894f9181a6a1fd58b4d14c8dfa9ede7a23f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs: crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in op_editor_ui::widgets::agent_settings_press_entries::apply_entry_hit at line 21. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_press_entries.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6f9d7519c9ca687c8f11f4461504874babbe34a48f26d32ba9816c01c14e5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/chat_session.rs: crates/op-host-desktop/src/chat_session.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_host_desktop::chat_session::execute_tool_requests at line 260. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/chat_session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/chat_session.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eb2679d84b1e19164b5dc3828722655a9077098c9d9d8fbf36303ca87d553d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-host-core/src/settings_io.rs: crates/op-editor-host-core/src/settings_io.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in op_editor_host_core::settings_io::apply_payload_with_options at line 316. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-host-core/src/settings_io.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/settings_io.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"141827c71739e86b9c63d80bad718749af5d3c8559b59868e051bcaa9db7a9cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-engine-ffi/src/lib.rs: crates/op-engine-ffi/src/lib.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in op_engine_ffi::op_pointer at line 412. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-engine-ffi/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":"crates/op-engine-ffi/src/lib.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7fb484488b17b11c86eabdbc2b4ca47b295eb1ea3a47c6298cf8ea87d4499a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/shortcuts.rs: crates/op-host-native/src/widget_host/shortcuts.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WidgetHostNative::apply_input_select_all at line 184. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/shortcuts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/shortcuts.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e296c6f9e04a5b6d23af39da88d6d0e395ab57ad7d77863881b8f641c997baa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/plan_normalize.rs: crates/op-orchestrator/src/plan_normalize.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in op_orchestrator::plan_normalize::normalize at line 109. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/plan_normalize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_normalize.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b768cd8665d15f9259f44fc9733e533ecb78400f719dce0606bbd5c0f110563"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/top_bar_paint.rs: crates/op-editor-ui/src/widgets/top_bar_paint.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TopBar::paint_chrome at line 17. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/top_bar_paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_paint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4573098f3a8e3b6d96a976891c342e14a1200e06087d78c87053e4884f958b66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/ime.rs: crates/op-host-native/src/widget_host/ime.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in WidgetHostNative::apply_ime_commit at line 139. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/ime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ime.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491a531190fbb4ccea998eea8a573e670d22e36030dc064a46931f7c673fc94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/release.rs: crates/op-host-native/src/widget_host/release.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in WidgetHostNative::apply_release_with_viewport_inner at line 37. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/release.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/release.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f36165544bf640e4efdd90e999b7458668cf834723fdaeaa04d03e7fce9c9e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/property_edit_mutators.rs: crates/op-editor-core/src/property_edit_mutators.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in EditorState::commit_property_edit_inner at line 69. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/property_edit_mutators.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/property_edit_mutators.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b3062d130038eb0d003b7658f797e279558426e4e693d9924e5be85e107d86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-preview-core/src/app_mode.rs: crates/op-preview-core/src/app_mode.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PreviewSession::reconcile at line 194. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-preview-core/src/app_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":"crates/op-preview-core/src/app_mode.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e530fd3cf294b060042badb43805617fb66378103ac46cfeace2c87195f9fb04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-pen-loader/src/layout_scene.rs: crates/op-pen-loader/src/layout_scene.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_pen_loader::layout_scene::blend_mode_to_scene at line 616. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-pen-loader/src/layout_scene.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-pen-loader/src/layout_scene.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"4612d0bd86e9303a77f1ce70e1068f1a0354a8296d5616b48934d358b22110d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/collab_panel.rs: crates/op-editor-ui/src/widgets/collab_panel.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in CollabPanel::paint at line 122. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/collab_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4136dcdcbe0d57a7c56ba2c07a73c45e79a22ff5e845b6c5b2fd8394b765e872"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/git_host.rs: crates/op-host-desktop/src/git_host.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in DesktopApp::drain_git_action at line 166. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/git_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/git_host.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"290b1debd0d4cb61f2d3f4a0041a46ccdb8aece43b116041492f11a8cd290b56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/concurrent.rs: crates/op-orchestrator/src/concurrent.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in op_orchestrator::concurrent::run_subtask_retry_ladder_with_outcomes at line 189. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/concurrent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/concurrent.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb073539b8316c4b8ced6cd1df119bff2bb52c606858a370a461838df9cddd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/live_sync_glue.rs: crates/op-host-web/src/live_sync_glue.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_host_web::live_sync_glue::push_document_if_changed at line 461. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/live_sync_glue.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync_glue.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"892f705e72402a0319fe2252ae905f73d5239d7a7cf9d79ce5fca32dad0d6baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/web_settings.rs: crates/op-host-web/src/web_settings.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_host_web::web_settings::apply_payload at line 398. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/web_settings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_settings.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"87493f00315ed6740cb9ceaaa117fb20b18a01b28f1b90a0c7f7c43a08ab527b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/geometry.rs: crates/op-host-native/src/widget_host/geometry.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WidgetHostNative::update_dropdown_hover at line 298. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/geometry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/geometry.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d4fa9287fa11432fb27e602f36287762d30e6cf4774cc949f9260d86aa3a5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/cursor_move_drags.rs: crates/op-host-native/src/widget_host/cursor_move_drags.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in WidgetHostNative::cursor_move_late_drag_tiers at line 52. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/cursor_move_drags.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_drags.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bcbd428a90ddeff8c1aee7aa594dd6bcffae507c70e7642841c02c6e15c7e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-host/src/runtime/network/owner.rs: crates/op-collab-host/src/runtime/network/owner.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in op_collab_host::runtime::network::owner::run_inner at line 67. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-host/src/runtime/network/owner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/owner.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b342b63e3b9272ed0db37a79ad52f7c36ca4af0219bd2e6e83d215ad3b996"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/dom_io.rs: crates/op-host-web/src/dom_io.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in op_host_web::dom_io::handle_paste_event at line 553. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/dom_io.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffbc0da99d8e7b570cd5b186db2da86f603545700a046091cef7c935c769017"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel/paint.rs: crates/op-editor-ui/src/widgets/property_panel/paint.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in PropertyPanel::paint at line 31. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel/paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/paint.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f216d155dc13bf72f21bcc54c5a81d87b581f60092d3dbfaf08f3e6a0a5cd69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/geometry_settings_hover.rs: crates/op-host-native/src/widget_host/geometry_settings_hover.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in WidgetHostNative::update_agent_settings_hover at line 12. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/geometry_settings_hover.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/geometry_settings_hover.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9a51c0a12a8fc6c830b9a23a3b367ca6c9da03b5a01a2bbc96be1266617f5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/press_overlay_tiers.rs: crates/op-host-native/src/widget_host/press_overlay_tiers.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in WidgetHostNative::press_menu_modal_tiers at line 165. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/press_overlay_tiers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8408e991f03410115289f2390d3c79e8000e8d363c2e9c35bbcebb18de895ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/top_bar_geometry.rs: crates/op-editor-ui/src/widgets/top_bar_geometry.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TopBar::button_rect_with_measure at line 359. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/top_bar_geometry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_geometry.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5a52f6c52bbdd3c465058d615838fe897c0cc9b7b2bdd38c11ec4dfc8cf3d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/prompt_center_previews.rs: crates/op-editor-ui/src/widgets/prompt_center_previews.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in op_editor_ui::widgets::prompt_center_previews::prompt_center_preview at line 68. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/prompt_center_previews.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/prompt_center_previews.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c32f63be3464222f898e94bdd177bbdf53f3ae3c465828737ad0cabe105455a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-mcp/src/batch_design.rs: crates/op-mcp/src/batch_design.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_mcp::batch_design::dispatch_batch_design at line 180. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-mcp/src/batch_design.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc383d70d086aeb55ed2c37750f15f9b21b62011d6a759f1b0c04bafd1fb50eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/home_surface.rs: crates/op-editor-ui/src/widgets/home_surface.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in HomeSurface::hit_test at line 209. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/home_surface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/home_surface.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae8128b8e3f1abd3c0d098387ccc94de2330da2b7fc87d28e8702ce577199b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/app_handler/pointer_events.rs: crates/op-host-desktop/src/app_handler/pointer_events.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in DesktopApp::on_left_press at line 109. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/app_handler/pointer_events.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/app_handler/pointer_events.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc9da3b8ed2ba4311f91b074bcdb0e0c7678eacd100fd187f50d7e759c08b99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/property_input_dispatch.rs: crates/op-host-native/src/widget_host/property_input_dispatch.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in WidgetHostNative::dispatch_file_menu_press at line 165. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/property_input_dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/property_input_dispatch.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9d7e5ae6048f713b82601212c8209f152b8eb0290f807d2159116d94ebbb9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/click.rs: crates/op-host-native/src/widget_host/click.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WidgetHostNative::apply_click at line 124. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/click.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/click.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb44047c0bfbe39e7b5496e62b512b43670f3ed3d5644e924c93eb63f5a53f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs: crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in op_editor_ui::widgets::property_panel_typography_paint::paint_font_picker_layout at line 151. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography_paint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae08f810cc4af863067a63c532c62d5c8e2b7cb877babfcb589068644298a8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/radial_repair.rs: crates/op-orchestrator/src/radial_repair.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in op_orchestrator::radial_repair::radial_stack_repair at line 489. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/radial_repair.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/radial_repair.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"73971fea913d167c2d32804f13cf7a028b55d1c6ee65b883858df13bde4468a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/import_warning_display.rs: crates/op-html/src/import_warning_display.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in ImportWarning::fixed_message at line 132. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/import_warning_display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/import_warning_display.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a4269f4598b06b3721e4efe7687ff3ea2519f51689b4b480f4d5c0ec06e92d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/lib.rs: crates/op-html/src/lib.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_html::import_html_with_resources at line 188. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/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":"crates/op-html/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669182fb497d6856a94cf938edd22709826c2554acd1f4f3053974d01c2f465"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/mcp_live.rs: crates/op-host-services/src/mcp_live.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in McpLiveServer::pump at line 239. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/mcp_live.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_live.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6284e49487e6b6df2b8eec2bbc0b7768edccda1b94c63ab6aecd3a255ff2260b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs: crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AIChatPlaceholder::paint at line 23. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel/widget_paint.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fdad812124b30cafb3664500fb28b6e7204f35afe84f152fa6022444fe4e9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-i18n/src/i18n/mod.rs: crates/op-i18n/src/i18n/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_i18n::i18n::translate_dynamic at line 303. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-i18n/src/i18n/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-i18n/src/i18n/mod.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab4660ccd70426666435ebc350d64547eea67e6ae698949ad51ff36dbcfcb9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/web_settings_validation.rs: crates/op-host-web/src/web_settings_validation.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SettingsValidationError::fmt at line 77. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/web_settings_validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_settings_validation.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac483502dbce29e3ae1be1c18ed945f6da47696ff0eb8af9bf2f96312592bbf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-chat-agent/src/design_agent_tools.rs: crates/op-chat-agent/src/design_agent_tools.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in op_chat_agent::design_agent_tools::execute_design_tool_with_root_seed_guard at line 172. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-chat-agent/src/design_agent_tools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38a31d91060f67937774489fc04a76e63c0af5bb0c8d8ef11eb815a33e1f31e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs: crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in op_editor_ui::widgets::ai_chat_panel_footer::paint_bottom_toolbar at line 338. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7278401305d5f29406e09dd084c9ecb0ef144300aae7afe3d3e6157cd95c6b3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packaging/ios/Sources/OpEngineHost.swift: packaging/ios/Sources/OpEngineHost.swift changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in OpEngineHost.drainShellActions at line 432. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- packaging/ios/Sources/OpEngineHost.swift\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":"packaging/ios/Sources/OpEngineHost.swift"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c465b7c6f2ef7fb5605c11a0d1a41828db2d884f8014c3cd583b71dad17f6356"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_typography.rs: crates/op-editor-ui/src/widgets/property_panel_typography.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in op_editor_ui::widgets::property_panel_typography::font_picker_layout_at_with_density at line 311. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_typography.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_typography.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64882aa3bd0db66a3b74bc90d099c3e980500c639e86825ffb0290ab3e8e777"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/release_input.rs: crates/op-host-web/src/widget_host/release_input.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in WidgetHost::apply_release_with_viewport at line 36. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/release_input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/release_input.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f7e1ab35801553f434036a6934529b4313f9fc0d2a0a3606a0843891fa423"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/keyboard_text_inputs.rs: crates/op-host-web/src/widget_host/keyboard_text_inputs.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in WidgetHost::focused_input_selected_text at line 143. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/keyboard_text_inputs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/keyboard_text_inputs.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe37afdc6556ac38c43ff96d13418768dc8c5443be86d08a141b9312d335658"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/home.rs: crates/op-host-native/src/widget_host/home.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in WidgetHostNative::press_home at line 13. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/home.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/home.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d58fa697f220b92d344d0a5c4251fd3f9a4701a6c496abdd64c5407e344109"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/file_menu.rs: crates/op-editor-ui/src/widgets/file_menu.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FileMenu::choice_for_row at line 254. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/file_menu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/file_menu.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edf29eb0f5574a5ef4c09da016481acb82029b80ed0cdf819b85a768ef3e7b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/instance/assignment.rs: crates/op-figma/src/instance/assignment.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in op_figma::instance::assignment::seed_assignments_from_instances at line 42. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/instance/assignment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/assignment.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2449e920a04c460bb003823cb294f62442f652076773386a7998804113dd1524"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/converters.rs: crates/op-figma/src/converters.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_figma::converters::convert_vector at line 562. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/converters.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/converters.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b2eb22a172b1cce9aff70865b47f0dd96e4ad4d5029ec1de3a3b70db4d14b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/style_guide_context.rs: crates/op-orchestrator/src/style_guide_context.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in op_orchestrator::style_guide_context::infer_tags_from_prompt at line 25. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/style_guide_context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/style_guide_context.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de505e3a717a89d5d7cdc733beb44c1756f5b379a27246d09580822c11d6380"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-chat-agent/src/chat_agent_loop/openai.rs: crates/op-chat-agent/src/chat_agent_loop/openai.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in op_chat_agent::chat_agent_loop::openai::run_openai_agent_loop_inner at line 37. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-chat-agent/src/chat_agent_loop/openai.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/openai.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e46636428fd08a0ad9ba16ad139b137e634857f3740585aebc5d53b2825bc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/menu.rs: crates/op-host-desktop/src/menu.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in op_host_desktop::menu::backend::action_for_id at line 110. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/menu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/menu.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"998bad9a272a0750b82f4b6f52cc21c89923f65ca202b717fa7fcb545dc6efe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/chat_http_server.rs: crates/op-host-services/src/chat_http_server.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in op_host_services::chat_http_server::run_opencode_turn at line 246. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_http_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_http_server.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81c14cc54a5a6ce7b93761ccd94a81970a7df3233e632fa8895f6cb86e6c00f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/web_auth_sync.rs: crates/op-host-web/src/web_auth_sync.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_host_web::web_auth_sync::apply_login_status at line 348. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/web_auth_sync.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_auth_sync.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0958eb1925062ddee845671829d44a9ccc93214b1e4d604532db3b313843e5a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-host/src/runtime/network/connection.rs: crates/op-collab-host/src/runtime/network/connection.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in op_collab_host::runtime::network::connection::drive_guest at line 188. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-host/src/runtime/network/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/connection.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd125f9cc6eff08faa1b11ea18fcfd8df21524aa55114e71cdd8242a662c7ca7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-host/src/runtime/effects.rs: crates/op-collab-host/src/runtime/effects.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CollabRuntime::route_guest_output_inner at line 348. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-host/src/runtime/effects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/effects.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"327ef75ec773132f4595c5539c50a554e354eee249445d172a90f14c6ddd99af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs: crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in op_editor_ui::widgets::agent_settings_press_flow::apply_agent_settings_hit at line 109. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_press_flow.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"16da1ca82bd4295c64140aadd58fab3932bca4e6985b9b112054440c9941ea93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/collab_ui.rs: crates/op-editor-ui/src/widgets/collab_ui.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in op_editor_ui::widgets::collab_ui::panel_session_or_pre_auth at line 215. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/collab_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_ui.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aea8b329fdcbbf39ec191506242e87d9b80916065e0124c0d4c9fac4cf7e69e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/cursor_move_panels.rs: crates/op-host-native/src/widget_host/cursor_move_panels.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in WidgetHostNative::cursor_move_floating_panel_tiers 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/cursor_move_panels.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_panels.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5af4d44450d6ecc01fa1487a04b6e269bee78fffaf2bb04fc10421f72579601"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/scene_template_press_flow.rs: crates/op-editor-ui/src/widgets/scene_template_press_flow.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in op_editor_ui::widgets::scene_template_press_flow::press_scene_template_center at line 26. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/scene_template_press_flow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_press_flow.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e61f69ce16cf71f34c66039f4e5e7ed3f034cbd034e69140881fddbea0daee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-preview-core/src/input_event.rs: crates/op-preview-core/src/input_event.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PreviewSession::dispatch_input_inner at line 342. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-preview-core/src/input_event.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/input_event.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872202a370dc732ff3ee8f963df7e8f8233833ad3bbeb2523799c8b54049661"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/agent_settings_mcp.rs: crates/op-editor-ui/src/widgets/agent_settings_mcp.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_editor_ui::widgets::agent_settings_mcp::paint_server_row at line 303. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/agent_settings_mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_mcp.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfcd72f01361c7038d9609532a1cf6b48354b563e457fbe0a6c92cf592c2574"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/compact_prompt.rs: crates/op-orchestrator/src/compact_prompt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in op_orchestrator::compact_prompt::build_compact_planning_prompt at line 36. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/compact_prompt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/compact_prompt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"982972cff0894127d247803b3b36bfbfea42874053e4d455eaeaf76ad919508e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/chrome_menu_press.rs: crates/op-host-web/src/widget_host/chrome_menu_press.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WidgetHost::dispatch_file_menu_press at line 13. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/chrome_menu_press.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/chrome_menu_press.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3fd8004fc3dcd99451b079bea476ceae86a65bc6b79cb64fa65dd1d3db7bf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: templates/step0/_generators/scene_preview_cards.py: templates/step0/_generators/scene_preview_cards.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in scene_preview_cards.main at line 272. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- templates/step0/_generators/scene_preview_cards.py\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":"templates/step0/_generators/scene_preview_cards.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fccab71e12a660d4fa2c145bd1bc58e2c154c73572fe01c1037710c487e96b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/figma_import_session.rs: crates/op-host-desktop/src/figma_import_session.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_host_desktop::figma_import_session::pump at line 411. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/figma_import_session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/figma_import_session.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"628bd027f247d0c71945b3463d35ea33dcb184f1086506ef7b20135f29406b54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/wheel_pan.rs: crates/op-host-web/src/widget_host/wheel_pan.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WidgetHost::apply_wheel_with_canvas_delta at line 169. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/wheel_pan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/wheel_pan.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a104cab1cae706979cbb9dfd2674dbd10ad90b33042cf2c9156feed7e9afad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/assets/snapshot-extractor.js: crates/op-html/assets/snapshot-extractor.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in snapshot-extractor.vectorizeSvg at line 586. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/assets/snapshot-extractor.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b599a8b63cdfa5a82509cf9bf280c6f7825770632109a0ed5c86c7e3c826750c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/collab_panel_interaction.rs: crates/op-editor-ui/src/widgets/collab_panel_interaction.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in CollabPanel::hit_test at line 11. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/collab_panel_interaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_panel_interaction.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda64b242731fdfa6f5ed7594b6bf5d7c70aa0fbd36a6e8f07838ba3dd9d0b1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/mobile_content_rail.rs: crates/op-orchestrator/src/mobile_content_rail.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in op_orchestrator::mobile_content_rail::collect_repairs at line 295. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/mobile_content_rail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_content_rail.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdeb2264628f6901b0254434c4c38d3b361d5a542e2fbf2fafccfae84338c68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/svg_export.rs: crates/op-editor-ui/src/svg_export.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in op_editor_ui::svg_export::emit_node at line 315. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/svg_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/svg_export.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9423146cb3e415903582cf3796926107060f52cec275339e688bc3295f7afdf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/cleanup_equalize_siblings.rs: crates/op-orchestrator/src/cleanup_equalize_siblings.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in op_orchestrator::cleanup_equalize_siblings::plan_family_repairs at line 237. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/cleanup_equalize_siblings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_equalize_siblings.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"531810eec68626f3c0c610e3f488c580fcdb8accb70ac845b2272f3f6ab35d93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/ai_proxy.rs: crates/op-host-services/src/ai_proxy.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in op_host_services::ai_proxy::proxy_builtin_for_identity at line 359. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/ai_proxy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/ai_proxy.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"938917bf74a020f3296a686beace3b9d7d6f5c9ba10ce2f6ecb74a6a3b3f78d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/collab_gate.rs: crates/op-editor-core/src/collab_gate.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in EditorCommand::collab_gate_action at line 385. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/collab_gate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/collab_gate.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3600a19c033c066d9aa57bac8d3cc8210036510c2ac29d93162f7f95a0e7d77e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/role_layout_post_pass.rs: crates/op-orchestrator/src/role_layout_post_pass.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_orchestrator::role_layout_post_pass::fix_horizontal_overflow at line 60. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/role_layout_post_pass.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_layout_post_pass.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0ad03f2b48164afeea87e20c802118b61b64de6509c12c212f3bc34f8ba3d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/press_overlay_tiers.rs: crates/op-host-web/src/widget_host/press_overlay_tiers.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WidgetHost::press_topmost_overlay_tiers at line 17. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/press_overlay_tiers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_overlay_tiers.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"492cef70533936d342361eb9958e44a51f961674af06a7053e4e93a895e27b9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/node_drag.rs: crates/op-host-web/src/widget_host/node_drag.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WidgetHost::apply_node_drag_cursor_move at line 119. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/node_drag.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/node_drag.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"af846ff624df504f0b116b260716ee8bc9ec01f81cd7ed6b7ee9122448bdeb34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_fill.rs: crates/op-editor-ui/src/widgets/property_panel_fill.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_editor_ui::widgets::property_panel_fill::paint_one_fill at line 358. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a3f5b5e700480fb21fdeb24c91b38f1d180cf58f7c552d610d894293a97e6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/press_chrome_tiers.rs: crates/op-host-web/src/widget_host/press_chrome_tiers.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WidgetHost::press_top_bar_tier at line 124. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/press_chrome_tiers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/press_chrome_tiers.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75ed24d39f86c513225cb80decddb011ee3a03bde1aab90b83df49069f1cbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-ai-skills/src/budget.rs: crates/op-ai-skills/src/budget.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_ai_skills::budget::trim_by_budget_pinned at line 121. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-ai-skills/src/budget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/budget.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a86ad0378636e0c1684c382ea2c04fb51696b5b756a148a9695efd78abe705"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/vector_decoder.rs: crates/op-figma/src/vector_decoder.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_figma::vector_decoder::decode_vector_network_blob at line 490. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/vector_decoder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/vector_decoder.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"656af06c085a08e4bfa80ba72955d05e1060c61fac0e5ce7b25023081fd4a377"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs: crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in op_editor_ui::widgets::agent_settings_panel_card::paint_agent_card at line 33. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_panel_card.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0648f2631d32b125526e9f9790c685935856616b7921680e7d92b90a9fd705b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-engine-ffi/src/desc.rs: crates/op-engine-ffi/src/desc.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in op_engine_ffi::desc::parse_create at line 276. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-engine-ffi/src/desc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/desc.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f63087e6b1058557ccbdc53766c328d83a890b32cb6b3b555d47c2531cb68ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/web_chat_standard_events.rs: crates/op-host-services/src/web_chat_standard_events.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in op_host_services::web_chat_standard_events::progress_label at line 60. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_chat_standard_events.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_chat_standard_events.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2036fb5eaae6be1eb5d4336ea4296789b8fcd10a48c7c65a36362602ec44b668"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: vendor/anthropic-agent-sdk/src/transport/subprocess.rs: vendor/anthropic-agent-sdk/src/transport/subprocess.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in SubprocessTransport::build_command at line 183. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- vendor/anthropic-agent-sdk/src/transport/subprocess.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":"vendor/anthropic-agent-sdk/src/transport/subprocess.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c0495f86b1223db8ba9826f1710eba5814dec172d913a153cd7fdad63a70a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_commit.rs: crates/op-editor-ui/src/widgets/property_panel_commit.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in op_editor_ui::widgets::property_panel_commit::property_focus_initial at line 33. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_commit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_commit.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c024ae20180fbe4a727d67e01e7a30ed574159b5957655ccb8a7388d41456bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/dom_io/document_io.rs: crates/op-host-web/src/dom_io/document_io.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in op_host_web::dom_io::document_io::drain_pending_file_action at line 32. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/dom_io/document_io.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/document_io.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd39a28e332373e51951968c05a77e160981d83f67ba543889fd4cab2434bde7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/text_input_focus.rs: crates/op-editor-core/src/text_input_focus.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in EditorState::active_text_input at line 12. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/text_input_focus.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/text_input_focus.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ff470eb586a49e6d2a7851c24174f535dbc64fe2cff784b9bbbe46bd5f7a3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-preview-core/src/present.rs: crates/op-preview-core/src/present.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in PreviewSession::pinned_nav_candidate at line 157. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-preview-core/src/present.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/present.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d4908c9d05b59b7327932580443bef5b052bc1c4eb99282663dd00fc2bb31c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/cursor_move_modals.rs: crates/op-host-native/src/widget_host/cursor_move_modals.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in WidgetHostNative::cursor_move_modal_tiers at line 13. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/cursor_move_modals.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_move_modals.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8186e338ea456ec50045c7ad91e318bb611d799398f897204160d23899d6444a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-design-lint/src/plan.rs: crates/op-design-lint/src/plan.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in op_design_lint::plan::detect_and_plan at line 94. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-design-lint/src/plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/plan.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c918adf55166155a24186565b7c37eb6664b7df359e3a7b501e83516128b097a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/mcp_live/connection.rs: crates/op-host-services/src/mcp_live/connection.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in op_host_services::mcp_live::connection::serve_connection at line 113. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/mcp_live/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_live/connection.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e7045490e7941837bfb03dc09af4b100fec346e0d6ab150bcd2871e38f6ce7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/touch_panel_gesture.rs: crates/op-host-native/src/widget_host/touch_panel_gesture.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WidgetHostNative::touch_panel_target_is_visible at line 671. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/touch_panel_gesture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/touch_panel_gesture.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcd88c3db2fb440c59adcdec141fd6d41e9107960af6a78a50c1d257c3abcd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/ai_chat_transcript_hit.rs: crates/op-editor-ui/src/widgets/ai_chat_transcript_hit.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in op_editor_ui::widgets::ai_chat_transcript_hit::transcript_hit at line 22. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/ai_chat_transcript_hit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_transcript_hit.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"910f1e9630a63f3d17b5816a4f22400941a2056d66a6e2f914523f3d5592f606"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/ai_chat_geometry.rs: crates/op-host-native/src/widget_host/ai_chat_geometry.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WidgetHostNative::ai_chat_rect at line 37. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/ai_chat_geometry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/ai_chat_geometry.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dcbed19c5ceb7e0f9ff54fbb00dc34e413c0244fccaef488510036eb3e8c1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/mapper.rs: crates/op-html/src/mapper.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_html::mapper::map_element_scoped at line 144. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/mapper.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fe74bef3828600705c71fc3d3ae67d2e18f821f714fff8f1ee716687a8e93c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/validation_fixes_b3.rs: crates/op-orchestrator/src/validation_fixes_b3.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_orchestrator::validation_fixes_b3::build_container_node at line 145. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/validation_fixes_b3.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_b3.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"322d9c3d1e63a98f626e7807b9ecbf3820f9596e0347fdfef9c3a66a46a66b0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-host/src/runtime/network/guest.rs: crates/op-collab-host/src/runtime/network/guest.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_collab_host::runtime::network::guest::run_inner at line 209. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-host/src/runtime/network/guest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-host/src/runtime/network/guest.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"00697c5c6621fab850b7137e3ec9af2f4b0ef6601bab5b9eb45e2e608f6953cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-chat-agent/src/chat_agent_loop/anthropic.rs: crates/op-chat-agent/src/chat_agent_loop/anthropic.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in op_chat_agent::chat_agent_loop::anthropic::run_anthropic_agent_loop_inner at line 80. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-chat-agent/src/chat_agent_loop/anthropic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_agent_loop/anthropic.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4766a4745521b8764aa5b692fd54853cb9347625aa0ce54ee9888160fdbf3d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/css/declarations.rs: crates/op-html/src/css/declarations.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in op_html::css::declarations::expand_declaration at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/css/declarations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/declarations.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd3657e160880f04e607573ed7068d1a22ff42cfac233b61869e8a598b6831"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/mcp_integrations.rs: crates/op-host-desktop/src/mcp_integrations.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_host_desktop::mcp_integrations::config_path at line 124. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/mcp_integrations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/mcp_integrations.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58d4796425501d973fec1f611004495ddae1c7abfc15ccf183d4d9190c18611"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/op_ck_image_cache.js: crates/op-host-web/src/op_ck_image_cache.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in op_ck_image_cache.createWebImageCaches at line 91. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/op_ck_image_cache.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01ceeb68112f80f505be45eedb1851fe7c2c22966e62af1b1cd6d476aff2d32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-desktop/src/design_session_workers.rs: crates/op-host-desktop/src/design_session_workers.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in op_host_desktop::design_session_workers::finish_design_success at line 290. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/design_session_workers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session_workers.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"618e603e534802bf0bb2299eab4a36c22683635ea57a2c6faabcdeccf1910999"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/text_contrast_repair.rs: crates/op-orchestrator/src/text_contrast_repair.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_orchestrator::text_contrast_repair::first_usable_fill_kind at line 228. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/text_contrast_repair.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/text_contrast_repair.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"45155ca8128722c0ccca4d6e9e3c581f4dc6b9c09d9a672342d94c5ff5062f05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/mobile_more_panel.rs: crates/op-editor-ui/src/widgets/mobile_more_panel.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MobileMoreEntry::label at line 131. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/mobile_more_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/mobile_more_panel.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd68f3fe57f2690a0a8ef5c82c6dfcfebb428ea78870fbfdc953c0ce2fdb782"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/variables_panel_press.rs: crates/op-host-native/src/widget_host/variables_panel_press.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in WidgetHostNative::dispatch_variables_panel_press at line 16. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/variables_panel_press.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/variables_panel_press.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29609790f02edaea3831d44effd8a62e472ea2bf05cf0117f98203e9d936420"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/canvas_viewport_text.rs: crates/op-editor-ui/src/widgets/canvas_viewport_text.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in op_editor_ui::widgets::canvas_viewport_text::paint_text_node at line 278. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport_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":"crates/op-editor-ui/src/widgets/canvas_viewport_text.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2ba584954f78448baef5365b07295a6c1857bea41d5443f9230e828241ad47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-design-lint/src/detectors/spacing.rs: crates/op-design-lint/src/detectors/spacing.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in op_design_lint::detectors::spacing::walk_edge_section_padding at line 431. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-design-lint/src/detectors/spacing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/spacing.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1163b3b54c85c9a47dc474afe02fa3f481c7a9890d1958a833e2cc2145577269"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/collab_ui_debug.rs: crates/op-editor-core/src/collab_ui_debug.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CollabUiAction::fmt at line 23. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/collab_ui_debug.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/collab_ui_debug.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85aeff12b12e8e0752391526d99fe5ebeae2311cd0cb952b4817498dd7b63bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/instance/fingerprint.rs: crates/op-figma/src/instance/fingerprint.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in op_figma::instance::fingerprint::score at line 202. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/instance/fingerprint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/fingerprint.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"71981e6f6c0c1dead835228724cd1a9e9ffeb451917710620dc8577432f0ff71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/cursor_hint.rs: crates/op-host-native/src/widget_host/cursor_hint.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in WidgetHostNative::cursor_hint at line 29. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/cursor_hint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/cursor_hint.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8130a0865885523e5f0ebb2c1d61783fedf0ef03c090e1b0e363a9a008492c6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-image-enrich/src/targets.rs: crates/op-image-enrich/src/targets.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_image_enrich::targets::image_search_target_for at line 182. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-image-enrich/src/targets.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/targets.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9f920452e2407bec8d3fc62be593db2e400d0fef7d8448ef333ba37db7b3ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/chat_claude.rs: crates/op-host-services/src/chat_claude.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ClaudeCodeProvider::send_inner at line 116. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_claude.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba54e437853d90bdf9060eb45a6b7da6a8fbdef0c83896de9009bcced84f3f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs: crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_editor_ui::widgets::property_panel_image_popovers::paint_generate_popover at line 218. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_image_popovers.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62e4958f4cf84e1f2c1cc3df463c5909a4986d724a641fd14e1ac0095a1f26a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/agent_settings_hover.rs: crates/op-host-web/src/widget_host/agent_settings_hover.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in WidgetHost::update_agent_settings_hover at line 14. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/agent_settings_hover.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/agent_settings_hover.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cdd7586f2880492418a8bab346851775cd4d3befcf29f335f36c8ddce8919c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/web_canvas_server/run_loop.rs: crates/op-host-services/src/web_canvas_server/run_loop.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_host_services::web_canvas_server::run_loop::run_web_canvas at line 28. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/run_loop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/run_loop.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0834664bcd68c126798fb9589576b518e9a05e3aaee48a082b3c0849e2d25d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/instance_override.rs: crates/op-editor-core/src/instance_override.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in op_editor_core::instance_override::route_display_state at line 335. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/instance_override.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/instance_override.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da69f4ef07916f291d91ae97a6696f43892665669947e89a2a38770ea59ac8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/instance/apply.rs: crates/op-figma/src/instance/apply.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in op_figma::instance::apply::apply_to_node at line 188. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/instance/apply.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/instance/apply.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"845dd29754da75a1b69d3159382dc4d9b47a371f6595c397a195a3d5710c8fdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-relay-client/src/session.rs: crates/op-collab-relay-client/src/session.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in op_collab_relay_client::session::pump at line 191. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-relay-client/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-client/src/session.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"329f4f9c700209e017a4b13a74b69c746d4a45e9d7e64bf71a71895cd5cff0b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/css/cascade.rs: crates/op-html/src/css/cascade.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_html::css::cascade::compute_raw at line 392. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/css/cascade.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/css/cascade.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b98a7839089e57af3bc3ae6f0032d60b84eae1b4efef5782344ce485a2a0a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/host_settings_commit.rs: crates/op-editor-core/src/host_settings_commit.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in op_editor_core::host_settings_commit::commit_settings_focus at line 48. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/host_settings_commit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/host_settings_commit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0737c6cb807c073089a951c4e069fb9e64fc04b86f9b8906a0d191afd23586cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/press_property_tiers.rs: crates/op-host-native/src/widget_host/press_property_tiers.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in WidgetHostNative::press_property_overlay_tiers at line 18. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/press_property_tiers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_property_tiers.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbbce337738a4111e49a1fbe6e4d92af872730cc75a5d1aefd9f48aa84a15d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/slides_panel.rs: crates/op-host-native/src/widget_host/slides_panel.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WidgetHostNative::blit_slide_thumbnails at line 180. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/slides_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/slides_panel.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da11564575a11dce6d774f42e40227fd4feb8cf88d5be0a6431a07b660f4a11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-relay-server/src/connection.rs: crates/op-collab-relay-server/src/connection.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in op_collab_relay_server::connection::relay_paired at line 477. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-relay-server/src/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-server/src/connection.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e996d85c01237b018239f1275024337cc51248d091589d546d3b6388d792cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/validation.rs: crates/op-orchestrator/src/validation.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_orchestrator::validation::run_post_generation_validation at line 425. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10a5352805eae0c12919516111263c3c5805bb8ab95fb623875afa31a83440d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/scene_template_hit.rs: crates/op-editor-ui/src/widgets/scene_template_hit.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SceneTemplatePanel::hit_test at line 100. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/scene_template_hit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/scene_template_hit.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b318d93153c4c7ea05aaaa6cbd68da29236288718368fee7e959731e59d9b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/collab_ui_action.rs: crates/op-editor-ui/src/widgets/collab_ui_action.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in op_editor_ui::widgets::collab_ui_action::action_model at line 5. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/collab_ui_action.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_ui_action.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490493bcdd5e45a5d6d94ed5a22d93b0bc9ded350df7c84d9b1582ecd9e5d8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-figma/src/image_resolver.rs: crates/op-figma/src/image_resolver.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in op_figma::image_resolver::patch_node at line 389. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-figma/src/image_resolver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/image_resolver.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32899c7533fef233f53aa8c0367f44a03cf692f04693ae3be79f6afd7c0f84a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-core/src/drag_mutators.rs: crates/op-editor-core/src/drag_mutators.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in EditorState::move_node_to_drop_target at line 298. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/drag_mutators.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/drag_mutators.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"121711aa25bcfe911efd954ea29cd33c0ca29dd3bfcd784757b3d08d63bd4f2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/layer_panel_hit.rs: crates/op-editor-ui/src/widgets/layer_panel_hit.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LayerPanel::hit_test at line 117. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/layer_panel_hit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/layer_panel_hit.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4398ea2dd87c9cac0b436f467efdc8925d4258e210b80dcbf765dd0131e1d254"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/role_infer.rs: crates/op-orchestrator/src/role_infer.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_orchestrator::role_infer::exact_role at line 25. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/role_infer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_infer.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55599e8b4fff88795ed7ac661b000e7662496cddf56afa07686b73970ee5c6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel/hit.rs: crates/op-editor-ui/src/widgets/property_panel/hit.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PropertyPanel::hit_test_action_logical at line 78. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel/hit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel/hit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea79aa0154f2acc63de11f4a53548942588d1fd1e2ffefaab33a31c8059d4cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-web/src/widget_host/ai_chat_geometry.rs: crates/op-host-web/src/widget_host/ai_chat_geometry.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WidgetHost::ai_chat_rect at line 23. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/ai_chat_geometry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/ai_chat_geometry.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8306515a9447f56a8d881317be8f00fba75bfa6b4e6ee100fdf8a3ab1e95af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-chat-agent/src/design_agent_tools/quality_scans.rs: crates/op-chat-agent/src/design_agent_tools/quality_scans.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_chat_agent::design_agent_tools::quality_scans::scan_header_icon_row_issues at line 79. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-chat-agent/src/design_agent_tools/quality_scans.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_tools/quality_scans.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a56e997cbd1c5b62791a6074aad3f36933a864ab584c43c928c62140204347c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-collab-relay-client/src/bridge/owner.rs: crates/op-collab-relay-client/src/bridge/owner.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_collab_relay_client::bridge::owner::run_owner at line 287. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-relay-client/src/bridge/owner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-client/src/bridge/owner.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8920b729621338cdca703b1e3c816480db0f3781cec405cc16fd0b8171afac1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/resources.rs: crates/op-html/src/resources.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_html::resources::embed_node_images at line 259. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/resources.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/resources.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3c76345b817a09569c4b0b9c86fed41a5ca5c6db657ce9e93b6ebfbbe25f4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/collab_ui_debug.rs: crates/op-editor-ui/src/widgets/collab_ui_debug.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CollabPanelActionModel::fmt at line 50. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/collab_ui_debug.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/collab_ui_debug.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"289b7d7320a52f80e77de548367a732e3143da50843a7939adb8b3dbab2b440e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/press_canvas_tiers.rs: crates/op-host-native/src/widget_host/press_canvas_tiers.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WidgetHostNative::press_canvas_select_tier at line 104. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/press_canvas_tiers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/press_canvas_tiers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1333452c5d4f19d7d41395f439ba79aa6aaeb5b046ede55fdfd0362e8d4d535a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-design-lint/src/fixes.rs: crates/op-design-lint/src/fixes.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in op_design_lint::fixes::set_property at line 14. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-design-lint/src/fixes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/fixes.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993d946222841168af561ba68400037f0f8d8dd8e0cd37249627eefc3197f81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs: crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in op_host_services::web_canvas_server::connection_ai_routes::serve_ai_route at line 38. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/connection_ai_routes.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e614a43a164811514622e90eb13acfb94a246731caaf73929f710e95fd5f435"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-opmerge/src/lib.rs: crates/op-opmerge/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in op_opmerge::merge_core at line 167. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-opmerge/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":"crates/op-opmerge/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"520b99fa88658285b3d2b17c156723a9981d369592ee34e032fca862e9719691"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/property_panel_code.rs: crates/op-editor-ui/src/widgets/property_panel_code.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_editor_ui::widgets::property_panel_code::code_action_rects_with_bottom at line 646. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/property_panel_code.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_code.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d26787f12aba8cc7b3fafbcb5cd4f7ddb8276bd766cf54c37e635a43359a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/spacing_repair.rs: crates/op-orchestrator/src/spacing_repair.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in op_orchestrator::spacing_repair::strip_in_value at line 94. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/spacing_repair.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/spacing_repair.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c920c939dd084f8b92be57bf78593be111f9d33bb2124ee14fc82adae3bdf2ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-preview-core/src/binding_sites.rs: crates/op-preview-core/src/binding_sites.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_preview_core::binding_sites::expression_node_uses_scope at line 168. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-preview-core/src/binding_sites.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/binding_sites.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"905eddd09f3a54ae514cae0c535f79db7cb062550b8145f2aba81e5d9710c393"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/op-chrome-extension/capture.js: packages/op-chrome-extension/capture.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in capture.capturePage at line 233. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- packages/op-chrome-extension/capture.js\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":"packages/op-chrome-extension/capture.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ea940a30d97624d51fa4349939a55d257d02b5ba03684161cf75a4cb0059c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-html/src/mapper_visual.rs: crates/op-html/src/mapper_visual.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_html::mapper_visual::map_fill at line 35. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/mapper_visual.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/mapper_visual.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d02b78a2a7bec81889a70f96575b89df102ca9ac4e85bc055f57b585cdccfb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/hero_bleed.rs: crates/op-orchestrator/src/hero_bleed.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in op_orchestrator::hero_bleed::enforce at line 16. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/hero_bleed.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/hero_bleed.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7ffa1d51eebfded0797e9465ae4937b1d79c6f20c614c1592a88c55caac6eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/op-chrome-extension/picker.js: packages/op-chrome-extension/picker.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in picker.startPick at line 46. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- packages/op-chrome-extension/picker.js\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":"packages/op-chrome-extension/picker.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df4abec769991ae6d04a0dc026522e58ffc772cb5a1d5825cf99d9b9bf552aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/avatar_repair.rs: crates/op-orchestrator/src/avatar_repair.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in op_orchestrator::avatar_repair::avatar_slot_repair at line 107. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/avatar_repair.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/avatar_repair.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"606d8d1134b51561e657a38e51453a983e5a7b17add0263ff9b1c883313cae67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-editor-ui/src/widgets/top_bar_tooltip.rs: crates/op-editor-ui/src/widgets/top_bar_tooltip.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in op_editor_ui::widgets::top_bar_tooltip::tooltip_for at line 57. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/top_bar_tooltip.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/top_bar_tooltip.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6667e76c032f0b15947ce12e980085456e41d3bf11c1f430fd96147a194a9eaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-mcp/src/codegen_plan_store.rs: crates/op-mcp/src/codegen_plan_store.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in op_mcp::codegen_plan_store::submit_chunk_result at line 514. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-mcp/src/codegen_plan_store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/codegen_plan_store.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9240ac7268069145d4ca27ce2a871656d19cef49105226e92a0d46b9b2fecda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-host-native/src/widget_host/paint_rail.rs: crates/op-host-native/src/widget_host/paint_rail.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WidgetHostNative::paint_left_rail at line 14. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/paint_rail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint_rail.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0176e2a53f4bd58c25168163949fd9d11c134bfabaf832258ed9351a6f3ca001"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-render-export/src/error.rs: crates/op-render-export/src/error.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ExportError::fmt at line 82. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-render-export/src/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-render-export/src/error.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"75665e585c06ac3c44a4fa511c9bf476d2b0ae7ea4daff60c5fdf35a244aaf75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-ai-skills/src/frontmatter.rs: crates/op-ai-skills/src/frontmatter.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in op_ai_skills::frontmatter::parse_skill_frontmatter at line 189. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-ai-skills/src/frontmatter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/frontmatter.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c18671b912cf22c54be2dca005910cb37837bc0ee3eb79e053b4a4cb4aa7ddb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-orchestrator/src/card_inner_padding.rs: crates/op-orchestrator/src/card_inner_padding.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in op_orchestrator::card_inner_padding::is_card_inner_padding_offender at line 105. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/card_inner_padding.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/card_inner_padding.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"48364644d8e9f510dc3abe00897b69d610bf2a4872b9bd7d15f1a9dc487f4efd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/op-chrome-extension/popup.js: packages/op-chrome-extension/popup.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in popup.onDownload at line 308. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- packages/op-chrome-extension/popup.js\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":"packages/op-chrome-extension/popup.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19119528da3817729a1362c66c9ec236931c76ef7df4963c750bb427b8ea6ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/op-engine-ffi/src/input.rs: crates/op-engine-ffi/src/input.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in GestureTracker::handle at line 208. 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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-engine-ffi/src/input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/input.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35c073ee28a910d6e3d0496a35f7807798a1f168296a03cf6765b6667ef9a06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/cleanup.rs: crates/op-orchestrator/src/cleanup.rs changed 55 times in last 90 days and 28 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 op_orchestrator::cleanup::run_cleanup_passes_with_summary_and_policy at line 385), 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(agent): retry a subtask that promises a list but delivers no items\u201D; \u201Cfix(agent): unify style drift across structural twins in a grid\u201D; \u201Cfix(agent): shrink single-line text that outgrows its rail instead of clipping it\u201D; \u201Cfix(agent): shift a pinned control back inside its parent instead of cropping it\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/cleanup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ad44fc826b523c3bf5bb2adb419305b7d84c078836a234df16433600c7877b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/chat_intent.rs: crates/op-host-services/src/chat_intent.rs changed 18 times in last 90 days and 12 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 op_host_services::chat_intent::classify_intent_llm_with_timeout_and_cancel at line 333), 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(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(agent): stabilize design execution (#212)\u201D; \u201Cfix(agent): inherit artboards for sibling screen continuations\u201D; \u201Cfix(ai): constrain retry replay to failed turns\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_intent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_intent.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f2bebc1a8b611025a9307a0808d420bbe35aa4a7ede62bacb13e530078939b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/role_post_pass.rs: crates/op-orchestrator/src/role_post_pass.rs changed 20 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is op_orchestrator::role_post_pass::post_pass_value at line 62), 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(agent): repair passes must prove what they claim to fix\u201D; \u201Cfix(agent): close deck opacity and cta corner-radius blind spots\u201D; \u201Cfix(agent): round missing corners on badges, pills, avatars and status dots\u201D; \u201Cfix(agent): keep nested card roles and rescue near-full-bleed orphan cards\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/role_post_pass.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf413f1d05a20c310ec2b1d02120c7487435b6f4fc38f49f7449cd6af63f4cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/scaffold.rs: crates/op-orchestrator/src/scaffold.rs changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is op_orchestrator::scaffold::plan_is_sidebar_dashboard at line 640), 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(canvas): attach frame-name labels to the frames they name\u201D; \u201Cfix(agent): give wrapped canvas rows headroom for frame labels\u201D; \u201Cfix(agent): scaffold a deck\u0027s screen roots in one insert\u201D; \u201Cfix(agent): give loop-built page roots the planner\u0027s section gap\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/scaffold.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/scaffold.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8361e1bc0a1d471d81887bf0d81a13ad54cabe7e8abb10ad783a41c3b8e1850"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-desktop/src/sub_agent_session.rs: crates/op-host-desktop/src/sub_agent_session.rs changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is op_host_desktop::sub_agent_session::pump_sub_agents at line 316), 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(agent): gate root-seed inheritance on real continuation intent\u201D; \u201Cfix(agent): inherit artboards for sibling screen continuations\u201D; \u201Cfix(editor): degrade instead of panicking on host failure paths\u201D; \u201Cfix(desktop): order chat tool events deterministically\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/sub_agent_session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/sub_agent_session.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"03448f1ad1803397c2a305966835885aec38e4da030fbaab363ddd39908e7829"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/model_discovery.rs: crates/op-host-services/src/model_discovery.rs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is op_host_services::model_discovery::extract_json_object at line 329), 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(agent): align codex cli and node resolution\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(agent): drop hidden models from the codex app-server list\u201D; \u201Cfix(desktop): prefer .exe/.cmd/.bat over extensionless npm shims on Windows (#191)\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/model_discovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/model_discovery.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f4e93b6bda856d7753be362cf5b48a237d012ea6169bf701ec14191702a5c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/vscode_bridge.rs: crates/op-host-web/src/vscode_bridge.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is op_host_web::vscode_bridge::route_message at line 191), 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(web): make bridge init survive slow mounts\u201D; \u201Cfix(web): preserve account entry in managed embeds\u201D; \u201Cfix(editor): improve import and generation reliability\u201D; \u201Cfix(mcp): working clipboard copy and real endpoint on the embed settings card\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/vscode_bridge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/vscode_bridge.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95161f11fc20cbe9e4f5b25a3c6e072e796385d4bd8acec2ce0916af96f136d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/model_profile.rs: crates/op-orchestrator/src/model_profile.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is op_orchestrator::model_profile::resolve_model_profile at line 434), 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(agent): treat the Claude Code CLI model aliases as full-tier models\u201D; \u201Cfix(ai): stop sending thinking:disabled to GLM-5.3\u201D; \u201Cfix(agent): classify the new builtin preset models for reasoning control\u201D; \u201Cfix(agent): preserve Kimi K3 design script output\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/model_profile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/model_profile.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bba07cba2a26d122d46a1418e666ab7b1b40559fbddb9edb6885e66f12556e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/op-vscode/src/vscode/pen-editor-provider.ts: packages/op-vscode/src/vscode/pen-editor-provider.ts changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is PenEditorProvider.mountEditor at line 253), 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(vscode): shift-tolerant redo, cmd\u002Bs save relay, and iframe autofocus\u201D; \u201Cfix(vscode): keep-last-active only for the mcp route; registry stays focus-following\u201D; \u201Cfix(vscode): 405 for non-POST /mcp and keep-last-active mcp routing\u201D; \u201Cfix(mcp): working clipboard copy and real endpoint on the embed settings card\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- packages/op-vscode/src/vscode/pen-editor-provider.ts\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":"packages/op-vscode/src/vscode/pen-editor-provider.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab75f68469bce4e02fe6bd76e72fd5b81a2837fe9e7bc1066ea1743fc39b5aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/web_canvas_server/online_run_loop.rs: crates/op-host-services/src/web_canvas_server/online_run_loop.rs changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is op_host_services::web_canvas_server::online_run_loop::run_online_web_canvas at line 128), 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(web): gate unix-only signal \u002B test helpers off the windows build\u201D; \u201Cfix(web): request-time epoch snapshots, AI write admission, drain without ceiling\u201D; \u201Cfix(web): make the identity reset claims real and cover /mcp in the write barrier\u201D; \u201Cfix(web): credential partition hygiene, shutdown write barrier, seed lifecycle\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/online_run_loop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/online_run_loop.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6db1732a4a94d1be6a7c8f4b693b880a4b3bf6bc3712dff1a173fb836770938"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/chat_spawn.rs: crates/op-host-services/src/chat_spawn.rs changed 9 times in last 90 days and 7 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 op_host_services::chat_spawn::well_known_install_paths at line 420), 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(agent): align codex cli and node resolution\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(agent): keep a customised process PATH ahead of the login shell\u201D; \u201Cfix(host): gate login shell probe on windows\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_spawn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_spawn.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81d51f5b06721f160796fa037603c7f03ec55659a7f2ab497cac27c0cc2ed4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-smoke/src/llm_clients.rs: crates/op-smoke/src/llm_clients.rs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is SmokeLlmClient::call at line 65), 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(ai): ride out provider 429s in the headless smoke client\u201D; \u201Cfix(agent): cap the whole non-streaming provider call in op-smoke\u201D; \u201Cfix(cli): scale op-smoke\u0027s read-idle timeout by the model profile\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-smoke/src/llm_clients.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/llm_clients.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"82efd546f4606afdc15034b772b24e09b7e5f8ec70c7f1abef89090c578c4a0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs: crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is op_editor_ui::widgets::canvas_viewport_overlay::wrap_segment at line 473), 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(web): render cached CanvasKit shader fills\u201D; \u201Cfix(canvas): keep container stroke above children when painting\u201D; \u201Cfix(editor): improve import and generation reliability\u201D; \u201Cfix(renderer): per-corner radii reach every FILL path\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_overlay.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9a12ce808a05e94f4b75f53c2785d02f35f6708240cbda884718e9913ffc13"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/provider_probe.rs: crates/op-host-services/src/provider_probe.rs changed 11 times in last 90 days and 6 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 op_host_services::provider_probe::install_command_for_platform at line 159), 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(agent): align codex cli and node resolution\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(agent): update winget package name from GitHub.CopilotCLI to GitHub.Copilot (#193)\u201D; \u201Cfix(agent): surface the cli\u0027s own error instead of \u0027not responding\u0027\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/provider_probe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/provider_probe.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd42ccd27f3eb29d03aa91fa1ec7236911e4b1380d73777f4df1a305f890ed3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-html/src/snapshot.rs: crates/op-html/src/snapshot.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is SnapshotError::fmt at line 57), 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(html): improve structured import style fidelity\u201D; \u201Cfix(html): raise the snapshot capture budget to 40k nodes and 48 MiB\u201D; \u201Cfix(html): make web-snapshot text, icon and layout capture faithful\u201D; \u201Cfix(html): fold inline-flow blocks into one styled snapshot text node\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/snapshot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/snapshot.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f182fe11dd8a478144cf91a8695d779832937917541681abd67cd94d1363ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-mcp/src/batch_design_result.rs: crates/op-mcp/src/batch_design_result.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is BatchDesign::insert_with_result at line 115), 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(editor): degrade instead of panicking on host failure paths\u201D; \u201Cfix(mcp): harden batch design and image semantics\u201D; \u201Cfix(mcp): an empty input slot is not a competing input\u201D; \u201Cmerge: sync mesh/shader rendering, web live-sync and platform fixes from remote\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-mcp/src/batch_design_result.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_result.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7012f703ed87b0ea26b2ba8a86de016441f053d521927ffa7704c134286642ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-desktop/src/image_panel_host.rs: crates/op-host-desktop/src/image_panel_host.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is op_host_desktop::image_panel_host::asset_status at line 240), 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(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(editor): async hygiene \u2014 safe block_on, bounded acp channels, thread teardown\u201D; \u201Cfix(panels): make image popover inputs fully editable\u201D; \u201Cfix(editor): embed relinked images and warn on machine-local links\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/image_panel_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/image_panel_host.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2233072a0ab336079257b16008e9f453b8231d187dd67456c96e174a917d5973"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/chat_subprocess_quirks.rs: crates/op-host-services/src/chat_subprocess_quirks.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is op_host_services::chat_subprocess_quirks::extract_codex_cli_error at line 308), 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(agent): match the Codex env allowlist case-insensitively (#232)\u201D; \u201Cfix(agent): deflake the subprocess, http-server, and probe tests\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(services): carry cli output into failures as bounded redacted tails\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_subprocess_quirks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess_quirks.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"639b0152a4c1c3a905eef3beb055feb797b330301c19a034d512b9610d4204a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/chat_provider_llm.rs: crates/op-host-services/src/chat_provider_llm.rs changed 7 times in last 90 days and 6 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 ChatProviderLlmClient::call at line 62), 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(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(agent): stabilize design execution (#212)\u201D; \u201Cfix(agent): default ACP agents to basic capability tier\u201D; \u201Cfix(editor): finish block_on_anywhere rollout and narrow design-ack snapshots\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_provider_llm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_provider_llm.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cccc66ba4c3a5e68ff2b429f5fb0cc8acd209b007ddd99db6e39b4c052abd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/run_tests_screen_groups.rs: crates/op-orchestrator/src/run_tests_screen_groups.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is op_orchestrator::run_tests_screen_groups::contains_text at line 79), 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(agent): inherit artboards for sibling screen continuations\u201D; \u201Cfix(agent): backfill generated screen interactions\u201D; \u201Cfix(agent): recover rejected radial sections\u201D; \u201Cfix(agent): parallelize scoped continuation screens\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/run_tests_screen_groups.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_tests_screen_groups.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c502d864fc470db95f996113aa1f729de4f52b3300c2b353d58d7d9760104547"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-native/src/widget_host/font_picker_dispatch.rs: crates/op-host-native/src/widget_host/font_picker_dispatch.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is WidgetHostNative::update_font_picker_hover at line 320), 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(editor): resolve native font availability through FontMgr\u201D; \u201Cfix(editor): polish mobile and tablet players\u201D; \u201Cfix(editor): align the font picker\u0027s wheel direction with every other list\u201D; \u201Cfix(editor): improve import and generation reliability\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/font_picker_dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/font_picker_dispatch.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dcd0dcfb2e0ab660be79a0ce8b50f941a7aa8ff4231683e6ef857788a36cae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/chat_subprocess_safety.rs: crates/op-host-services/src/chat_subprocess_safety.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is IsolatedTurn::prepare_for at line 178), 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(agent): keep the natively-cased Windows vars for guarded CLIs (#233)\u201D; \u201Cfix(ai): carry the CLI\u0027s own logged cause into the failure\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(services): carry cli output into failures as bounded redacted tails\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_subprocess_safety.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_subprocess_safety.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"075ba61ae09987a5186eef0153417fd2d1844f5a2f2b564499aaddc1341f4c06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/cleanup_mobile_chrome.rs: crates/op-orchestrator/src/cleanup_mobile_chrome.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is op_orchestrator::cleanup_mobile_chrome::is_pencil_trailing_tab_section at line 659), 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(agent): normalise the tab row, not the wrapper that stacks it over the home indicator\u201D; \u201Cfix(agent): harden generated mobile geometry\u201D; \u201Cfix(agent): harden mobile rail edge cases\u201D; \u201Cfix(agent): enforce mobile content rails\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/cleanup_mobile_chrome.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_mobile_chrome.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfed0fd39df2cef84e4fd40fac367ad2cf803c62a348e2db88b75c826398eab7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-image-enrich/src/net/providers.rs: crates/op-image-enrich/src/net/providers.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is op_image_enrich::net::providers::run_first_search_with_judge at line 313), 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(ai): surface openverse failures instead of a silent zero-candidate round\u201D; \u201Cfix(agent): rewrite the search query once before the judged ladder falls to Wikimedia\u201D; \u201Cfix(ai): route the first-search image client through rustls\u201D; \u201Cfix(ai): embed only renderer-decodable stock images and soften isolation fence\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-image-enrich/src/net/providers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/providers.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9a8b5846e69d356d8c1992cef9bb0af5b9faa3d0afd985dd23a0a0654527a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/web_fonts.rs: crates/op-host-web/src/web_fonts.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is op_host_web::web_fonts::request_font_bytes at line 305), 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(editor): resolve native font availability through FontMgr\u201D; \u201Cfix(editor): alias Microsoft YaHei and YaHei UI as one family (#216)\u201D; \u201Cfix(editor): improve import and generation reliability\u201D; \u201Cfix(web): rebuild layout scene on system-font load too\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/web_fonts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_fonts.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f286e28b9c2eb2f251e6cc5276d67b8555f225ec8a9c0c26db26d3830c4f6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-image-enrich/src/net/fetch.rs: crates/op-image-enrich/src/net/fetch.rs changed 7 times in last 90 days and 5 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 op_image_enrich::net::fetch::fetch_judged_wikimedia at line 241), 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(ai): surface openverse failures instead of a silent zero-candidate round\u201D; \u201Cfix(agent): rewrite the search query once before the judged ladder falls to Wikimedia\u201D; \u201Cfix(agent): judge the wikimedia fallback instead of falling open to its first page\u201D; \u201Cfix(ai): embed only renderer-decodable stock images and soften isolation fence\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-image-enrich/src/net/fetch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-image-enrich/src/net/fetch.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"14388587249ef528da19777e167ecc6ee319a4ab8338ca48b2b4080d33e5aaa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/cli_provider_probe.rs: crates/op-host-services/src/cli_provider_probe.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is op_host_services::cli_provider_probe::query_models at line 280), 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(services): parse the two-column antigravity model catalog\u201D; \u201Cfix(agent): give networked model probes a budget past the cli\u0027s own error\u201D; \u201Cfix(editor): async hygiene \u2014 safe block_on, bounded acp channels, thread teardown\u201D; \u201Cfix(agent): share timeout diagnostics with model discovery probes\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/cli_provider_probe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/cli_provider_probe.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6c2850f46d5eea7ace553c0a4ad8c845f72b8f2c5be2dbcdf0aad48b0e712c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/wire_screen_navigation.rs: crates/op-orchestrator/src/wire_screen_navigation.rs changed 7 times in last 90 days and 5 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 op_orchestrator::wire_screen_navigation::best_tab_row_path at line 373), 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(agent): repair passes must prove what they claim to fix\u201D; \u201Cfix(agent): backfill generated screen interactions\u201D; \u201Cfix(agent): target nested navigation tab rows\u201D; \u201Cfix(agent): retarget active tabs on unified navs and keep tab bars off detail screens\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/wire_screen_navigation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/wire_screen_navigation.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2b4cbdca0104ac142420606f4bff237599e69441622cfff9d8d6f80f15eb34"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/web_canvas_server/tenant.rs: crates/op-host-services/src/web_canvas_server/tenant.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TenantRegistry::update_acl at line 633), 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(web): request-time epoch snapshots, AI write admission, drain without ceiling\u201D; \u201Cfix(web): credential partition hygiene, shutdown write barrier, seed lifecycle\u201D; \u201Cfix(web): wire the review remedies end to end\u201D; \u201Cfix(web): close the review\u0027s high-severity online gaps\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/tenant.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/tenant.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"49594c2d592cf8792b22f137d7d35a06ff2a63b2f4b96bd4a68437595837e137"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs: crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs changed 6 times in last 90 days and 5 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 op_editor_ui::widgets::canvas_viewport_widget::paint_widget_visual at line 51), 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(renderer): hit only the active tabs panel and drop unpainted widget strokes\u201D; \u201Cfix(editor): render interactive widgets with authored design tokens\u201D; \u201Cmerge: sync mesh/shader rendering, web live-sync and platform fixes from remote\u201D; \u201Cfix(canvas): don\u0027t arm an erase frame when a design run finishes empty\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_widget.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f3e6d2ff5957e8cc2b0bec9dbdb7a99f1fa8a90442d123dae3aa12543beacb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-acp/src/client.rs: crates/op-acp/src/client.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is op_acp::client::connect_remote at line 677), 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(desktop): retry an acp agent spawn that hits etxtbsy\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(services): carry cli output into failures as bounded redacted tails\u201D; \u201Cfix(editor): async hygiene \u2014 safe block_on, bounded acp channels, thread teardown\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-acp/src/client.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-acp/src/client.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba7f69b77e09f443d54aa40fad0c49faed614a85ee1acb6a4496871875b3129"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-desktop/src/update_check.rs: crates/op-host-desktop/src/update_check.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is op_host_desktop::update_check::asset_name_for at line 258), 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(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(desktop): fall back to the releases feed when the GitHub API is rate limited\u201D; \u201Cfix(desktop): show update check status\u201D; \u201Cfix(editor): finish block_on_anywhere rollout and narrow design-ack snapshots\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/update_check.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/update_check.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9416c02efe71524b5b76998743e413272d542a9953a017426761dabe05b945"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/live_sync_conflict.rs: crates/op-host-web/src/live_sync_conflict.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is op_host_web::live_sync_conflict::preserve_local_document at line 26), 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(web): satisfy canvaskit clippy on the live-sync modules\u201D; \u201Cfix(web): credential partition hygiene, shutdown write barrier, seed lifecycle\u201D; \u201Cfix(web): wire the review remedies end to end\u201D; \u201Cfix(web): recovery affordance, tenant-aware URLs, and restore isolation for online\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/live_sync_conflict.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync_conflict.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e55be11817efe70d5b0c75871e5f605c978aa8c8ffb0e3931c4ac82e0524f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-collab-transport/src/tcp.rs: crates/op-collab-transport/src/tcp.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is op_collab_transport::tcp::wait_for_connect at line 189), 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(collab): clamp kernel keepalive to whole seconds\u201D; \u201Cfix(web): unbreak linux CI \u2014 keepalive EINVAL and the bundle tripwire\u201D; \u201Cfix(collab): close a gesture whose release never arrives\u201D; \u201Cfix(collab): normalize blocking mode on accepted sockets\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-transport/src/tcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-transport/src/tcp.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16f94877df7153398fa8564ffd24923dc9685652f202d05df0536fc82679e02"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/web_canvas_server/collab_state.rs: crates/op-host-services/src/web_canvas_server/collab_state.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is WebCanvasState::ingest_document_in_session at line 343), 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(web): request-time epoch snapshots, AI write admission, drain without ceiling\u201D; \u201Cfix(web): make the identity reset claims real and cover /mcp in the write barrier\u201D; \u201Cfix(web): credential partition hygiene, shutdown write barrier, seed lifecycle\u201D; \u201Cfix(web): wire the review remedies end to end\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/collab_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/collab_state.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ed36c355fc2b7bdf8c32df35d96f86e75a3a4e9b15509fb12b6e3f56193fbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-smoke/src/audit_rubric.rs: crates/op-smoke/src/audit_rubric.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is op_smoke::audit_rubric::node_kind at line 244), 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(agent): retry a subtask that promises a list but delivers no items\u201D; \u201Cfix(agent): backfill generated screen interactions\u201D; \u201Cfix(agent): target nested navigation tab rows\u201D; \u201Cfix(agent): honor multi-screen commitments across the design loop\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-smoke/src/audit_rubric.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-smoke/src/audit_rubric.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"137bc20d56e7173c269c8ad80bc10008faaa04937572dd0a9d5bc71c76153003"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-ui/src/widgets/agent_settings_fonts.rs: crates/op-editor-ui/src/widgets/agent_settings_fonts.rs changed 7 times in last 90 days and 4 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 op_editor_ui::widgets::agent_settings_fonts::hit_test at line 229), 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(editor): polish mobile and tablet players\u201D; \u201Cfix(editor): improve import and generation reliability\u201D; \u201Cfix(panels): CJK-aware button widths and a visible hover wash\u201D; \u201Cfix(panels): fit-content widths for missing-font buttons\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/agent_settings_fonts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_fonts.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b493d5443e8e9ba69b34a78b7be6094e941de38cb7fefaeee6e867b7cace830e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-desktop/src/image_decode_host.rs: crates/op-host-desktop/src/image_decode_host.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ImageDecodeHost::pump at line 122), 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(desktop): serialize test drains of the shared decode registry\u201D; \u201Cfix(desktop): drain stale image decode entries\u201D; \u201Cfix(editor): degrade instead of panicking on host failure paths\u201D; \u201Cfix(editor): improve import and generation reliability\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/image_decode_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/image_decode_host.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"029c35dd8fb73c907572c6dfaf1b298896d7f8cbfcca00c040ae9701cb36180d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: templates/step0/_generators/tpl_slides.py: templates/step0/_generators/tpl_slides.py changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is tpl_slides.chart at line 326), 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(editor): tighten template copy that wrapped into orphan lines\u201D; \u201Cfix(canvas): attach frame-name labels to the frames they name\u201D; \u201Cfix(agent): give wrapped canvas rows headroom for frame labels\u201D; \u201Cfix(panels): scroll the template grid on trackpad, and lay the deck out\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- templates/step0/_generators/tpl_slides.py\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":"templates/step0/_generators/tpl_slides.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0550759a4d054a64ce772a6d427617b9c93650b762753aa78260b11d51e3cc5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-native/src/backend/skia/text.rs: crates/op-host-native/src/backend/skia/text.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is NativeBackend::draw_text at line 186), 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(renderer): shape complex scripts instead of painting them in storage order (#194)\u201D; \u201Cfix(editor): improve import and generation reliability\u201D; \u201Cfix(renderer): apply image-fill crop transforms and metric text baselines\u201D; \u201Cfix(renderer): serialize native skia font access via jian font lock\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/backend/skia/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":"crates/op-host-native/src/backend/skia/text.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e5d2f2a7ab8e5795f8195a3d89b7d5985535031089b24d2ac4d4cdd791c139"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/retry.rs: crates/op-orchestrator/src/retry.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is op_orchestrator::retry::is_non_retryable at line 15), 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(agent): auto-fix ring concentricity and stop degrading on quality rejections\u201D; \u201Cfix(orchestrator): fail fast on deterministic CLI transport errors\u201D; \u201Cmerge: sync mesh/shader rendering, web live-sync and platform fixes from remote\u201D; \u201Cfix(canvas): don\u0027t arm an erase frame when a design run finishes empty\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/retry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/retry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3926f2b69443a964063b43aad7820b34417580965dcbe6115d09d32182021947"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-chat-agent/src/backoff.rs: crates/op-chat-agent/src/backoff.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is op_chat_agent::backoff::send_with_backoff at line 168), 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(agent): route every Studio task family to the design pipeline\u201D; \u201Cfix(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(ai): deadline provider streams on read idle, not total time\u201D; \u201Cfix(ai): apply reasoning control on the anthropic wire and gate zero-write design runs\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-chat-agent/src/backoff.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/backoff.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"16051deebc801bd996177601da1aa4c55d04f700d642a828393b58e7f9772ed2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/op-vscode/src/vscode/webview-shell.ts: packages/op-vscode/src/vscode/webview-shell.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is webview-shell.appendEmbedQuery at line 19), 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(vscode): shift-tolerant redo, cmd\u002Bs save relay, and iframe autofocus\u201D; \u201Cfix(vscode): insert embed flag before any url fragment\u201D; \u201Cfix(vscode): append embed flag after asExternalUri so the query = survives unencoded\u201D; \u201Cfix(vscode): match shell relay control messages by parsed type, not substring\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- packages/op-vscode/src/vscode/webview-shell.ts\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":"packages/op-vscode/src/vscode/webview-shell.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccdf0b4be7b10e3413e3d99ee0fe143e53d2f8385b066e3ecb987661a07b244"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-preview-core/src/tests_effects.rs: crates/op-preview-core/src/tests_effects.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is op_preview_core::tests_effects::effects_doc at line 16), 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(editor): seed the preview clock from the host and start lifecycle motion once the device frame settles\u201D; \u201Cfix(editor): hand the envelope\u0027s activation to the runtime\u201D; \u201Cfix(editor): let confirm\u0027s answer branches run again\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-preview-core/src/tests_effects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-preview-core/src/tests_effects.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08bd83be23e39ce22d3313ca1521551e53fea8374d8baf9686dc7b7c5ee7a0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/mcp_serve/file_path.rs: crates/op-host-services/src/mcp_serve/file_path.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is op_host_services::mcp_serve::file_path::process_message_for_file_path_arg at line 19), 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(mcp): run the finalize pipeline on file-mode session end and cheap repairs per write\u201D; \u201Cfix(agent): render model-drawn icon paths as catalog icons and teach icon_font\u201D; \u201Cfix(mcp): normalize mobile screens on every MCP write path\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/mcp_serve/file_path.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/mcp_serve/file_path.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448b68560ae2e4c6c34ef3e9d498d1efdc5649b9d7f304409ce7b1bc2426d62"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/live_sync_identity.rs: crates/op-host-web/src/live_sync_identity.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is op_host_web::live_sync_identity::reset_for_new_identity at line 45), 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(web): admit metadata writes, prove the thumbnail branches, close AI gaps\u201D; \u201Cfix(web): make the identity reset claims real and cover /mcp in the write barrier\u201D; \u201Cfix(web): wire the review remedies end to end\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/live_sync_identity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/live_sync_identity.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29e89a96d5fa572f4d2a8860f5990f5c4c8de5ed65a642d54fbc629beceed3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/canvaskit/backend.rs: crates/op-host-web/src/canvaskit/backend.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is CanvasKitBackend::draw_text at line 337), 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(web): render cached CanvasKit shader fills\u201D; \u201Cfix(web): normalize canvas wheel and raster scaling\u201D; \u201Cfix(renderer): shape complex scripts instead of painting them in storage order (#194)\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/canvaskit/backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit/backend.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f63972d20dbb9467ffbaeeb0d272b73f36947a687347cda1e407225290288c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-mcp/src/batch_direct_ops.rs: crates/op-mcp/src/batch_direct_ops.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is op_mcp::batch_direct_ops::parse_single_direct_operation at line 22), 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(ai): accept the payload dialects models actually write\u201D; \u201Cfix(mcp): preserve sizing keywords in update operations\u201D; \u201Cfix(mcp): harden batch design and image semantics\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-mcp/src/batch_direct_ops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_direct_ops.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"25be837789a8fe73b49b1535197313773f2b1cae5ca8cdc075c8a0eda103fb84"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-native/src/widget_host/text_edit_press.rs: crates/op-host-native/src/widget_host/text_edit_press.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is WidgetHostNative::text_edit_press_offset at line 185), 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(renderer): measure chrome text in its painted font\u201D; \u201Cfix(editor): center top bar title group\u201D; \u201Cfix(renderer): apply image-fill crop transforms and metric text baselines\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/widget_host/text_edit_press.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/text_edit_press.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9229666ff031888c9223e8e79d70e3456860f7fbc88e8c435e25ebf774ffaa0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/dashboard_columns.rs: crates/op-orchestrator/src/dashboard_columns.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is op_orchestrator::dashboard_columns::infer_dashboard_section_height at line 200), 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(agent): stop landing pages from scaffolding as sidebar dashboards\u201D; \u201Cmerge: sync mesh/shader rendering, web live-sync and platform fixes from remote\u201D; \u201Cfix(canvas): don\u0027t arm an erase frame when a design run finishes empty\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/dashboard_columns.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/dashboard_columns.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b247c75e6d65ca35a896554148d8318fe427254772c92f106a791e6c513a19a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-mcp/src/editor_state_tool.rs: crates/op-mcp/src/editor_state_tool.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is op_mcp::editor_state_tool::get_editor_state_snapshot at line 63), 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: \u201Cmerge: sync mesh/shader rendering, web live-sync and platform fixes from remote\u201D; \u201Cfix(canvas): don\u0027t arm an erase frame when a design run finishes empty\u201D; \u201Cfix(ci): rustfmt, clippy -D warnings, and stale test fixes for green rust-check\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-mcp/src/editor_state_tool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/editor_state_tool.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a6e136c372d5dac0c0c604e4cc173e17bb5f63ee531e7bdd77479749e4b89b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/tree_heuristics_text_band.rs: crates/op-orchestrator/src/tree_heuristics_text_band.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 op_orchestrator::tree_heuristics_text_band::fix_invisible_text_band at line 190), 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(agent): keep a content panel with body text and buttons off the accent wall\u201D; \u201Cfix(ai): stop stripping the ground out from under a screen\u201D; \u201Cfix(ai): stop painting the status bar with the design accent\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/tree_heuristics_text_band.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/tree_heuristics_text_band.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f7a2178c8732ac1359c020c16c18f5d579d65e31fa337201b4cc72e1c7efe3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-desktop/src/collab_avatar_host.rs: crates/op-host-desktop/src/collab_avatar_host.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 4 (its worst body is CollabAvatarHost::poll_jobs at line 136), 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(desktop): guard the fork-leave avatar rotation against the decode test window\u201D; \u201Cfix(html): improve layout and image fidelity\u201D; \u201Cfix(desktop): drain stale image decode entries\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-desktop/src/collab_avatar_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/collab_avatar_host.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75afe0e5c2632e3ce9f92b71c934bd964038f1777d10091e8380f8debcffa0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/acp_agent_probe_host.rs: crates/op-host-services/src/acp_agent_probe_host.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 7 (its worst body is op_host_services::acp_agent_probe_host::validate_probe_session at line 144), 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(agent): upgrade Copilot SDK and CLI lifecycles\u201D; \u201Cfix(agent): make ACP connection probes generation-safe\u201D; \u201Cfix(editor): async hygiene \u2014 safe block_on, bounded acp channels, thread teardown\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/acp_agent_probe_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/acp_agent_probe_host.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d582217665bcb026d07ebd562dd5c7310c36a3e0dcd9157d16a15c594e37dc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-html/src/dom.rs: crates/op-html/src/dom.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 10 (its worst body is op_html::dom::harvest_head at line 168), 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(html): improve layout and image fidelity\u201D; \u201Cfix(html): improve structured import style fidelity\u201D; \u201Cfix(editor): improve import and generation reliability\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-html/src/dom.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/src/dom.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6902a9d5e162cb47dd06bcd009965752aa652c2d7ed614095380690922195882"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-core/src/missing_fonts.rs: crates/op-editor-core/src/missing_fonts.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 14 (its worst body is op_editor_core::missing_fonts::component_override_font_family_stacks at line 85), 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(editor): resolve native font availability through FontMgr\u201D; \u201Cfix(editor): alias Microsoft YaHei and YaHei UI as one family (#216)\u201D; \u201Cfix(editor): improve import and generation reliability\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-core/src/missing_fonts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/missing_fonts.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0554c693f522d4f358b002b5f3b1996aee3205f2827e8fe198b22c5b7d6b35ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-collab-relay-locator-server/src/production.rs: crates/op-collab-relay-locator-server/src/production.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 5 (its worst body is ProductionLocatorConfig::from_env at line 74), 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(collab): rotate production trust roots safely\u201D; \u201Cfix(collab): harden p2p collaboration against resource exhaustion\u201D; \u201Cfix(locator): isolate unix hsm support\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-collab-relay-locator-server/src/production.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-collab-relay-locator-server/src/production.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb82b54889534c36c8b37bc3c2e27f93b86db08d369319e128c88b584034441"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/web_credential_sync.rs: crates/op-host-web/src/web_credential_sync.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 8 (its worst body is CredentialSyncState::complete at line 78), 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(web): request-time epoch snapshots, AI write admission, drain without ceiling\u201D; \u201Cfix(web): make the identity reset claims real and cover /mcp in the write barrier\u201D; \u201Cfix(web): keep credential sync reset ahead of repaint wiring in mount\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/web_credential_sync.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/web_credential_sync.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"504d0c92b7b05230b0b3235a5cd046fa89bd9eb7077b35cf42ef50d4b47f8d9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/web_canvas_server/tenant_auth.rs: crates/op-host-services/src/web_canvas_server/tenant_auth.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 7 (its worst body is StaticVerifier::resolve at line 250), 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(web): credential partition hygiene, shutdown write barrier, seed lifecycle\u201D; \u201Cfix(web): wire the review remedies end to end\u201D; \u201Cfix(web): close the review\u0027s high-severity online gaps\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/tenant_auth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/tenant_auth.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a242296a96be00c9d79532df71d8820fffbc8149a626c98b7e35819669ba3131"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-ui/src/widgets/canvas_frame_labels.rs: crates/op-editor-ui/src/widgets/canvas_frame_labels.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 10 (its worst body is op_editor_ui::widgets::canvas_frame_labels::paint_frame_labels at line 157), 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(canvas): attach frame-name labels to the frames they name\u201D; \u201Cfix(canvas): align generating label icon with text\u201D; \u201Cfix(canvas): polish selection overlays and viewport fit\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_frame_labels.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_frame_labels.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"febe4de5089b43cda80737517981b45fdd8b2d6c79a485c6d840ae2472378293"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-native/src/context/shared.rs: crates/op-host-native/src/context/shared.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 5 (its worst body is SharedSkiaContext::resize at line 226), 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(desktop): recover from unusable native GL on Windows startup\u201D; \u201Cfix(desktop): prefer fewest-MSAA GL config so skia wraps intel framebuffers\u201D; \u201Cfix(native): unblock linux startup \u2014 provider GL loader \u002B wayland-dlopen\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/context/shared.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/context/shared.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"81729f640fa3e917963e4497c7e13f4a47032eba98de6edf5e4ab3adc88aaa5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/map_placeholder.rs: crates/op-orchestrator/src/map_placeholder.rs changed 3 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 8 (its worst body is op_orchestrator::map_placeholder::collect_patches at line 48), 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(agent): map placeholder skips decorations inside a hand-drawn map and narrow map shapes\u201D; \u201Cfix(agent): map placeholder reads as a map \u2014 tonal blocks, heavier route ending mid-row\u201D; \u201Cfix(agent): map placeholder only replaces the map slot, never its section\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/map_placeholder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/map_placeholder.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efebcf932db77aa82ca1c7ccdde3f201125cf95fa9b514f7f243527e7c2a84e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/cleanup_overflow_prepass.rs: crates/op-orchestrator/src/cleanup_overflow_prepass.rs changed 3 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 2 (its worst body is op_orchestrator::cleanup_overflow_prepass::run_overflow_prepass at line 9), 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(agent): shrink an over-wide pinned row to its parent with mirrored insets\u201D; \u201Cfix(agent): inset fill_container children of none stacks and pad flush cards\u201D; \u201Cfix(agent): give phone controls the 44px touch floor the corpus promises\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/cleanup_overflow_prepass.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_overflow_prepass.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"69531a2df62e4115b05a2a6f68e0cfe4d45658aae55b24a47ed87133cb97b0a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-ui/src/widgets/canvas_viewport_image/decode_registry.rs: crates/op-editor-ui/src/widgets/canvas_viewport_image/decode_registry.rs changed 3 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 6 (its worst body is op_editor_ui::widgets::canvas_viewport_image::decode_registry::note_pending_decode at line 31), 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(renderer): stop a concurrent decode pump from starving an export\u201D; \u201Cfix(editor): improve import and generation reliability\u201D; \u201Cfix(renderer): queue image panel previews for async decode\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_viewport_image/decode_registry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_image/decode_registry.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d57c3b6506b2ad88d5aacddfc05efb59865ae485383c476b2692bf285bd227"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/chat_intent/context.rs: crates/op-host-services/src/chat_intent/context.rs changed 3 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 9 (its worst body is op_host_services::chat_intent::context::detect_append_intent at line 60), 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(ai): advertise chat CRUD tools regardless of canvas selection\u201D; \u201Cfix(ai): normalize scripted modification nodes\u201D; \u201Cfix(ai): preserve modify context across retries\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/chat_intent/context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_intent/context.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1aa928fae74ffb6762dec7820a977cb46541acb583bb968b0a2c8a9205c4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-orchestrator/src/nav_issues.rs: crates/op-orchestrator/src/nav_issues.rs changed 3 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 11 (its worst body is op_orchestrator::nav_issues::scan_nav_issues at line 75), 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(agent): repair passes must prove what they claim to fix\u201D; \u201Cfix(agent): target nested navigation tab rows\u201D; \u201Cfix(agent): honor multi-screen commitments across the design loop\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-orchestrator/src/nav_issues.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/nav_issues.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d702bbdb28330ae5584bc3506d4d9d58f89977da57d0d7c49d35a1824353e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-web/src/widget_host/agent_settings_mcp_server.rs: crates/op-host-web/src/widget_host/agent_settings_mcp_server.rs changed 3 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 5 (its worst body is op_host_web::widget_host::agent_settings_mcp_server::request_mcp_server_update at line 33), 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(web): admit metadata writes, prove the thumbnail branches, close AI gaps\u201D; \u201Cfix(web): recovery affordance, tenant-aware URLs, and restore isolation for online\u201D; \u201Cfix(web): attach bridge token to the mcp server settings fetch\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-web/src/widget_host/agent_settings_mcp_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/widget_host/agent_settings_mcp_server.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60c47e9ab34e7ed543dc2bd3bcf5e8b4f81dd36eaf19b66e3980b77e0429041"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-services/src/web_canvas_server/tenant_store.rs: crates/op-host-services/src/web_canvas_server/tenant_store.rs changed 3 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 5 (its worst body is TenantStoreError::fmt at line 76), 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(web): wire the review remedies end to end\u201D; \u201Cfix(web): recovery affordance, tenant-aware URLs, and restore isolation for online\u201D; \u201Cfix(web): close the review\u0027s high-severity online gaps\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-services/src/web_canvas_server/tenant_store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_canvas_server/tenant_store.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f27241a8e664c6052d659e4c747413e39fe936e3ba9630d45b2d22507d535a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-editor-ui/src/widgets/canvas_selection_overlay.rs: crates/op-editor-ui/src/widgets/canvas_selection_overlay.rs changed 3 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 5 (its worst body is op_editor_ui::widgets::canvas_selection_overlay::paint_selected_node at line 29), 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(renderer): measure chrome text in its painted font\u201D; \u201Cfix(canvas): align overlays with ancestor transforms\u201D; \u201Cfix(canvas): polish selection overlays and viewport fit\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-editor-ui/src/widgets/canvas_selection_overlay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_selection_overlay.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5407e7d50f6f504ad02f3182f0b19b1c2d2252d9f2febb58b507719eb3ddb16"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/op-host-native/src/context/provider.rs: crates/op-host-native/src/context/provider.rs changed 3 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 3 (its worst body is GlutinProvider::release at line 426), 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(desktop): recover from unusable native GL on Windows startup\u201D; \u201Cfix(desktop): prefer fewest-MSAA GL config so skia wraps intel framebuffers\u201D; \u201Cfix(native): unblock linux startup \u2014 provider GL loader \u002B wayland-dlopen\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-24..2026-09-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-24 15:25:11 \u002B08:00\u0027 --until=\u00272026-09-22 15:25:11 \u002B08:00\u0027 --full-history --no-merges -- crates/op-host-native/src/context/provider.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/context/provider.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31f01cdb6bf164bce956edaebc5f873c05089ac5e75e8faceeaf1452dc78fe4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 479 significant file(s) lose their only recent owner: crates/op-html/src/import_warning.rs, crates/op-host-services/src/web_canvas_server.rs, packaging/ios/Sources/OpEngineHost.swift, crates/op-html/src/css/selectors.rs, packaging/android/app/src/main/kotlin/tech/zseven/openpencil/OpSurfaceView.kt, crates/op-figma/src/instance.rs, crates/op-host-web/src/codegen_web.rs, crates/op-collab-host/src/runtime.rs (\u002B471 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"98d978ff52553c84e506455f25d1b5b08eee8b2777b3b4b7f85afd4c74f9334b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 223 significant file(s) lose their only recent owner: crates/op-orchestrator/src/run_orchestrator.rs, crates/op-orchestrator/src/cleanup.rs, crates/op-preview-core/src/session.rs, crates/op-orchestrator/src/prompt_subagent.rs, crates/op-preview-core/src/input.rs, crates/op-orchestrator/src/types.rs, crates/op-editor-ui/src/widgets/scene_template_panel.rs, crates/op-host-web/src/widget_host/preview_slideshow.rs (\u002B215 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9f551fbf04abcef78d54703b5857c382d8287b9466499337f70a42949b9472d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// (design_session.rs \u0060BeginUndoBatch\u0060 TODO). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_canvas_tools.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"29de700715fe6b469ade1dcf6231ac3ba5e926f8f31bc9984b285fc25f0fb4e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! PARITY TODO: consumer-view enrichment (enrichNodeLocallyForAIConsumerView) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/ai/assets.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a565a4272fec778a81a5237f1b4f1b021d041d7aa02492b91b474fbd01db81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //!   route path is read-only here; editing it is a v2 TODO). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_interactions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"381cbdd3e2c5b141cc1b86f698f51b496d1f5e4b2e630e244d71b886f347c717"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(host): wire into op-editor-core history batch mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/design_session.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e74bb9c353f776c61f533896024459a5976e301684ef4e5b475c709f236dc6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hosted-quota): the free tier becomes its own \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/home.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72576bf46589f1addddfa051eea62a2f797171c913923ea284c2965a13d9813"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(follow-up, needs \u0060provider_probe.rs\u0060): have \u0060connect_provider\u0060 forward \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/cli_provider_probe.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"363dbd8d5b44310e92fc9793303385644fb1c13feab6db5e08d7bf5783adaf60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: wire a real IconResolver trait when host-side icon lookup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_b3.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb95480ddb6f90ae29e3dacacf848f56d2b5548de9b014e7cf4087e6d5c382a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: resolve icon d-string via an \u0060IconResolver\u0060 trait when available. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_b3.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9491ca97679e07de55df5ddf0185ee9c96c346f7fe2c2d83bfe733d7442d137c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: icon resolver \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_b3.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f41230cc2bfacf8edbae0ff5a774ddc4327ec8d8862e84827ee9844a9bccdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: icon resolver \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/validation_fixes_b3.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2683222513b7ccd41ef6b995b6c6fdcb95a7e1214c77de567bad6aaa8f0297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(reconcile w/ Kayshen e3ed2f1e \u0022normalize mobile bottom tabs\u0022): 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":"crates/op-orchestrator/src/cleanup_nav_surface_tests.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c803756c4420833736ba85aed1ae476b9eedeec0bdc2392f8bff2b3d05853f"}},{"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":"Redundant creation methods with unclear distinction. \u0060new_session\u0060 likely creates a session with default options, while \u0060new_session_with\u0060 takes explicit options. However, the naming convention is inconsistent with standard patterns like \u0060create\u0060 vs \u0060create_with\u0060 or \u0060new\u0060 vs \u0060new_from_options\u0060. More critically, \u0060NewSessionOptions\u0060 is a struct, suggesting \u0060new_session\u0060 should just accept optional parameters or a builder pattern, rather than having two distinct entry points that do the same core action.: Unify into a single method \u0060new_session(options: Option\u003CNewSessionOptions\u003E)\u0060 or use a builder pattern. If defaults are complex, keep \u0060new_session\u0060 but rename \u0060new_session_with\u0060 to \u0060new_session_with_options\u0060 for clarity, or better yet, deprecate \u0060new_session\u0060 in favor of \u0060new_session_with(None)\u0060. (signatures: op_acp.client.AcpConnection.new_session(): Result | op_acp.client.AcpConnection.new_session_with(options: NewSessionOptions): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fd859ae309afffc57354609d3db59f2bfff2cb296c7d9d3e51637ab6f053ebb5"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous semantic overlap between \u0027close\u0027 and \u0027delete\u0027. In many session-based APIs, \u0027close\u0027 terminates the active session but may keep state, while \u0027delete\u0027 removes it entirely. However, the naming \u0060close_session_if_supported\u0060 and \u0060delete_session_if_supported\u0060 suggests these are capability-gated operations. If the underlying protocol treats them as distinct lifecycle stages, the names are okay, but if they are often used interchangeably or one implies the other, this is confusing. Given the presence of \u0060supports_session_close\u0060 and \u0060supports_session_delete\u0060, they are likely distinct, but the API surface feels cluttered with capability checks that could be handled internally or via a single \u0060terminate_session\u0060 method.: If \u0027close\u0027 and \u0027delete\u0027 are semantically distinct in the protocol, keep them but consider if a higher-level \u0060terminate_session\u0060 method that handles both cases based on availability would be cleaner. If they are truly distinct, the current naming is acceptable but verbose. (signatures: op_acp.client.AcpConnection.close_session_if_supported(session_id: str): Result | op_acp.client.AcpConnection.delete_session_if_supported(session_id: str): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33e89e98d968a9457fde31f53cdb2553050a2f07a83f7482ff0f2f930370a1a4"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant send methods. \u0060send_cancellable\u0060 is a specialized version of \u0060send\u0060. The existence of \u0060supports_cancellable_send\u0060 suggests that \u0060send\u0060 might not be cancellable, but the API user has to know which method to call. This splits the intent of \u0027sending a request\u0027 across two methods based on a capability flag, which is a common anti-pattern.: Unify into a single \u0060send\u0060 method that accepts an optional cancellation token or handles cancellation internally if supported. Alternatively, use a builder pattern for the request that includes cancellation options. (signatures: op_ai.chat_provider.ChatProvider.send(request: ChatRequest): Box | op_ai.chat_provider.ChatProvider.send_cancellable(request: ChatRequest, _cancel: AtomicBool): Box)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e590cae510c744841112cf9c3dc8473b6607598a8e5b281eeb05dde86ae7869b"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate intent across different types. Both \u0060OpenAiToolCollector\u0060 and \u0060AnthropicToolCollector\u0060 have a \u0060handle\u0060 method that takes a string and returns a \u0060ChatDelta\u0060. This suggests a common trait or interface should be defined for tool collectors to abstract away the provider-specific parsing logic.: Define a common trait \u0060ToolCollector\u0060 with a \u0060handle\u0060 method and implement it for both OpenAI and Anthropic collectors. This allows generic code to process tool calls without knowing the specific provider. (signatures: op_ai.chat_tool_sse.OpenAiToolCollector.handle(data: str): ChatDelta | op_ai.chat_tool_sse.AnthropicToolCollector.handle(data: str): ChatDelta)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ae81b6ba51b8f90684446add6c3844a81842ce505aab08094ccddeb0c275ab1"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return types and naming for CRUD operations. \u0060user_style_guides\u0060 returns a single \u0060UserStyleGuide\u0060 (likely the last one or a default?), \u0060set_user_style_guides\u0060 takes a single \u0060UserStyleGuide\u0060 but the name implies plural, \u0060remove_user_style_guide\u0060 returns a \u0060UserStyleGuide\u0060 (the removed one?), and \u0060load_user_style_guide\u0060 also returns a \u0060UserStyleGuide\u0060. The naming is inconsistent (\u0060guides\u0060 vs \u0060guide\u0060) and the return types are unclear (is it the updated state, the removed item, or a success indicator?).: Standardize naming to singular/plural consistently based on the data structure (e.g., \u0060get_style_guides\u0060 returning a list). Clarify return types: use \u0060Option\u003CUserStyleGuide\u003E\u0060 for removal/load to indicate success/failure, or return a unit type \u0060()\u0060 for mutations if the state is managed internally. (signatures: op_ai_skills.style_guide.user_registry.user_style_guides(): UserStyleGuide | op_ai_skills.style_guide.user_registry.set_user_style_guides(guides: UserStyleGuide) | op_ai_skills.style_guide.user_registry.remove_user_style_guide(id: str): UserStyleGuide | op_ai_skills.style_guide.user_registry.load_user_style_guide(guide: UserStyleGuide): UserStyleGuide)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"72ff7f9e081e21f84710917e11c2adc4c7dd73727094b59c5292158992e10020"}},{"ruleId":"D26","level":"note","message":{"text":"Split crates/op-editor-core: A generic editor core at 62k LoC across 12 namespaces is a sprawling grab-bag. Suggested: "},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c414846ec80dacab58a84522b4357b83a43453743b760360c401962c6582153b"}},{"ruleId":"D26","level":"note","message":{"text":"Split crates/op-editor-ui: An op-editor UI with 16 namespaces and 531 public types is an unfocused UI assembly. Suggested: "},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"229c1a7e7bf5356567b9c6d8dd1b50309848b83548b832e999604e5fc77f2c0b"}},{"ruleId":"D26","level":"note","message":{"text":"Split crates/op-orchestrator: An orchestrator project with only two namespaces and 275 public types is a focused unit. Suggested: "},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"36a3a0aee48249cfb319fb1b04dca396fc6cae7b249c28d87031f27ee8f74a03"}},{"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":"b8fd801632b4a4dd91d0f5afcf781b9bf9b0989354b90eb4ef38830e80cb50d3"},"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":"9c342aa782ce3a59dfc436011f3b01d2960bf0141b52807c088520588e0aec0e"},"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":"cbe787c4693250584f63afd6e4243baf8d6f28e00d2a0cd06bad7db9d81c9d76"},"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":"2d2d7bb83536034750e23a2a13112a309b4660a0b2e3ab0a3767d7322ff6803d"},"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":"dc0d0b66341057612310cabcbb155e935999f45eae20073d6259ff3fa71cc6a0"},"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":"863b750c1bc72824a2e6ec0558a2d9feee1b1e6ab4f3cde9ad3ed2add9b32afb"},"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":"656aeacc265f094b724d91c008d6727ecffc64f6df7138c1db43e8c3c9bebdfb"},"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":"05d22db70fedcb007fca60ba247ad7629ffb31d9b9cfce94b152230cdce7240a"},"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":"7e9ccb4d97b8864a9a55e44341aaba1880907c57b18e562f251e13f1a236683b"},"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":"0f686783c0659312a4319b4445c7bc209c68166c281abbc38d0a4cc0da7632a5"},"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":"f7c10d83b8387e3f45532dd9b171b32fc51255da784009cc5cdc2888b17f9352"},"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":"4330a78e732e81924e66423dd4c303e48d5e3fdfd708cd74d4fe83f9fbb0d234"},"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":"8ec428e130743b9d8f05e050398a96cc80c5cd359f4ebc3d60ad464630102b87"},"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":"c62c6b6bd0f5f8b0807e8be5b962e993543586356d550c659f47116c6c032eb9"},"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":"7a69c0afd85c73b0852ec9b932864ef7d66dd384432b6386bf409aae60e9bf5b"},"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":"740f479ea9bf17f3bb774824dabe5d7ec6167dbcfc7750fb1b480dd533884570"},"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":"8a74713d9116e10b6c0296c75835b8bdc5abeaf7005efa7c64c446c5adc005bb"},"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":"1af3a64741a8ce8cfa337ebd5929b80672707040188470fd077f11eeda87b860"},"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":"6764d888383a3106436153b3f99f8f7d660aed096f71c0e47225b24d58c946ed"},"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":"0c19f1b46d0f62311b07b3c111716cca156e15a3ec454a04054caeb1a6e46b35"},"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":"3bb356b3a56be3562463ceb38fe1d7b963eb6b8217648012108b9d7829ad11e6"},"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":"be04205f6bbe135b36cbb3eefb9b9ab7ff0aeacfa4a934182da94c696a002bf4"},"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":"c01b551005bf0789bd5a02dd4739cb2da472c5d4ad2f9b29bfae52f3f620668e"},"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":"bd4f00ccae3fb2e0e74155a099191753ed52b346dae2a5a2c730e0acf223e52f"},"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":"cd2c7cb024d93ef60155beb66f1e706230cc4bd6c35f0ef86e27d65975e7e00c"},"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":"7a1d40413a936d669107213bdbd1ff6b9a882f12e9ada480f2788498857ad7f1"},"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":"092c6a4634626a1876ebacc35b8add9fea00c31cb3adf3975ab3a7cd0abf8e15"},"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":"da40a444d77ee0e8fb904f7db64d188ffceb7e2f6e9dfc53191edc84f2ecf52f"},"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":"bbc23f460e24d29b96b452bb8b2a4a86d7eb8eb7ae3f640596d03d93b55ca1b7"},"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":"fdc09748e0da09e300f8b656365bf4fe8bc1ac80fa71a8cb1b6f1e068089e0dc"},"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":"42ee8713c77c910693d3affbd239ca193c86271e5b7e3c018c978e4b9c34bebd"},"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":"a20d6f4faa4b5792e1a151edaeaf3df94bc92046107bd2d30528ea820207388c"},"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":"25c1399b23237ae7195ff450ac195d0f8fb31cbc028628ab4be01bf7dacd6c9b"},"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":"f479556a455fc09b974022de088331adc180d8235daa0f03d2ba874d68a1ac2b"},"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":"055e175c3ed469abc8caa7466ed8e476be01a9c560694d9c18d47a6ac5cd986d"},"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":"888f142473370f3cd25946135ddecbeb2bddd878ae90dc23f46b61dc67e10c6d"},"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":"f4b57ba3f4793f0cd81ad730f27299be0cf43224f7ff731d2dce84ce935819c1"},"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":"de09708f22c76381eb6139a29b35da05980ff3fbc5a96be346e3480f6647d721"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","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":"9e68db7a32071e3cb8b14d31322df3d60dc922d12da34b6461dac9701f0f2d88"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"dafe1f233e561c6498b14b8497cf1956bba842c0d2638e02756221c2e282dd40"},"taxa":[{"id":"CWE-125","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":"48eb6d0cbda83a9cde5922503271cb6af21866adc121fe46a6e4c830d0630c2f"},"taxa":[{"id":"CWE-926","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":"44800ed90ac3c3db4c0a9b516d3e01d3a52fcde72701853cfa8626e3d1c3a1c1"},"taxa":[{"id":"CWE-926","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":"81fda7a2a553efc300f40659c5f28205202e375482051e4fc9434cc78e1bc2a1"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7ce7343c9d4834685304e95cd8781a697446476c06fe2cacc67df2c8d3cac882"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3d40c8a8a112a199f4a8c8575aa0a4ce751d977bd77203fc5d45d844f80a0da8"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7b58f5310e21c387627b4215b60506ba6c8002b7d3c46931a6688fd59361e63b"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"a2e13d199771dbb54e3fa5366b704e0087d015744550b6ec25f5a3c64a49aa0c"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e256d5eb1eca95a02198606c04b6b45617eb2a240f254069a28b666c557d4c26"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"881cbf59468410a6b5aa5b67a56e9b72011f84ea976f1cca620b3e36a15fb605"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e3347e656f388b47b060e89d7872c8a23c7fe99065bc0d57b1b054ae176f2142"},"taxa":[{"id":"CWE-444","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9a6ae764e67fa8911530b386353b8c0ace6e4f44e34d83aa2ec4b95a0093a8ba"},"taxa":[{"id":"CWE-444","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9d07271f03156faf75e23a1a52d6747f4a1c67a6e10b83cc4b9c314209d23752"},"taxa":[{"id":"CWE-444","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"84a1157650929db5a0b0318faf8d0ed22ebb57d4703ddab96d878771823c17d7"},"properties":{"dependency":{"package":"org.bouncycastle:bcprov-jdk18on","version":"1.79","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"6531bc3a0eaf08c513d8ff8a23ac62cf55c65d9a79ab58276bc859f4f37b98bd"},"properties":{"dependency":{"package":"io.netty:netty-handler","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"e2c84a6c85efce4059472c0d55c86d59fccef65dd7c65d9ae857917985adcf83"},"properties":{"dependency":{"package":"io.netty:netty-handler","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"b5308f9ed219ff7d361ed2b01ab7b5fa7a33b0013fcd35575e7068ccda1d2997"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0185"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"00200430e4c6666dab6bfd32ca66731fd8771f390cd1c127d69510a9d155dbc5"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"db077f8bc2f9fa136bdfa3002a5adedd3af087c7478c27ed16ef2a593da8cbf3"},"properties":{"dependency":{"package":"nanoid","version":"3.3.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"904b2015ead5e4967db89cc47ae77bd8a39e38e8bddc2d097c214b83210a69dc"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"9110209b9121a6889dd9f1ebb0d9583ce3be2d8d2628d49149174af518efe1af"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"15dde08c5a9972225e230a29666c315e9e2bb008cef2f269d9a8f082f45bba3f"},"properties":{"dependency":{"package":"postcss","version":"8.5.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b1c424870267bd58c9635104e2485a584375cb89dba4acf12e11d550571aafa0"},"properties":{"dependency":{"package":"undici","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"0a7b3524a380ba83e10c1cd9ffd3ee3c85838a861cedc643cc005e7c29213a4d"},"properties":{"dependency":{"package":"org.jdom:jdom2","version":"2.0.6","advisory":"[GHSA redacted]","aliases":["BIT-solr-2021-33813","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"901bac1140fcd0676baadedbc46b8d96db60c5aa1bd1973e4e2f912d4e022038"},"properties":{"dependency":{"package":"org.bitbucket.b_c:jose4j","version":"0.9.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"8ad6b29f67d94913a1826c30ad4440057456d0a270aee70c5dc46054cfa6dc5a"},"properties":{"dependency":{"package":"com.google.code.gson:gson","version":"2.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","SNYK-JAVA-COMGOOGLECODEGSON-1730327"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"4f68557c1d9fa29da4258d0349b80c7b645d9317db3dda9e6798caab28108c34"},"properties":{"dependency":{"package":"io.netty:netty-codec","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"003828d3503d5b6a997f1750ce54c7386e9b8b544fa1df67b9fdcda365c0f8e9"},"properties":{"dependency":{"package":"io.netty:netty-codec","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"53a2a11761d920cecd1d6a6e1581886069ea04a2aa92417d7986eb02f61e6c24"},"properties":{"dependency":{"package":"io.netty:netty-codec-http","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"f6f7a478a5fccffd4a112e9fa49385fbb781e5bc8c72121553419c0c1639eff5"},"properties":{"dependency":{"package":"io.netty:netty-codec-http","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ca39a5dfd8ce5c951708c6f434d02a9ef400d78bd085f3d3ee1d33cfad2c5d4a"},"properties":{"dependency":{"package":"com.google.protobuf:protobuf-java","version":"3.24.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"6f104131c12ab87eeeb93c47f50ce2a794bec3602fb68c0b88eb9b53544c6e54"},"properties":{"dependency":{"package":"com.google.protobuf:protobuf-kotlin","version":"3.24.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a0ecd76af8648402e33cf4e4d453bea5bb3dfb4f825b43cca19e8c91288489eb"},"properties":{"dependency":{"package":"io.netty:netty-codec-http2","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"767f4530f6003175031de4758ddd6bd0741b5dda9c748c2f5b02852078fc3603"},"properties":{"dependency":{"package":"io.netty:netty-codec-http2","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA 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":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","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":"797ec891dfd99b7619050a86882892acbf3f86688cb157c579039ad688d6ad76"},"properties":{"dependency":{"package":"backoff","version":"0.4.0","advisory":"RUSTSEC-2025-0012","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":"0b4d0bd0ea0d3a81846d91c999f1c98d63806893d9b8b2fd8c703eaa81f667a7"},"properties":{"dependency":{"package":"tar","version":"0.4.45","advisory":"[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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.3","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3035e85b1a9c0c33df37dc333f490439b3fa52aefda24a401e2e75a177cdf778"},"properties":{"dependency":{"package":"rustls","version":"0.23.40","advisory":"RUSTSEC-2026-0285","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d64f767f88bf5bd5ff8f6f6a0ff59b3a6285c439c38ea17a6c7e0c1e9936c81"},"properties":{"dependency":{"package":"cryptoki","version":"0.12.0","advisory":"RUSTSEC-2026-0286","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df691cc99f3e8fb86d48ee46855179b3cdba241d86939b5716509241a7420189"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"36967f53592cd978ae630cc4273dfacac8c2f7b0ea31a3b1b7faa17aea82fc7c"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"4696a573469ebba91cc8fb1eba6a75e7321f26fced334890498c381b49386c22"},"properties":{"dependency":{"package":"vitest","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"packages/op-web-sdk-react/test/design-view.test.tsx","line":1}}}},{"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":"911f746422a866a24d761e1c1e17786dadea42fa4fbc3fd3b4fe61942e2b847c"},"properties":{"dependency":{"package":"markdown-it","version":"14.3.0","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"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":"a309ec65c927334fce3bf63057c3f9ae823eafa9c041fcfc468b472e07ca5806"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","reachability":{"kind":"production","file":"packages/op-vscode/build.mjs","line":1}}}},{"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":"cdb906fd4ad099629d879529c6bfd9e55d46cefa72f6e43a0e7d64f52ca09bcb"},"properties":{"dependency":{"package":"io.netty:netty-common","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"c5b0423f2796ad9aeba9cbf2a544fab2df777bd01c278757adc05dc7f793fd1a"},"properties":{"dependency":{"package":"io.netty:netty-common","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"d40c4135033669e164c7117a67ab66beb8b3f3258372fae3bf9a3d19b7c3c860"},"properties":{"dependency":{"package":"org.apache.commons:commons-compress","version":"1.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"c298412dbdf9065eada4b3e03bbbb04a97d5c9d2ea45bc95fdf5316fbe537728"},"properties":{"dependency":{"package":"org.apache.httpcomponents:httpclient","version":"4.5.6","advisory":"[GHSA redacted]","aliases":["[CVE 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":"215a72f45a3bd9a142d24b99a58e8380f43e674e332b7f13bd728875b0357863"},"properties":{"dependency":{"package":"org.jetbrains.kotlin:kotlin-gradle-plugin","version":"2.0.21","advisory":"[GHSA redacted]","aliases":["[CVE 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":"2c578f55e2006dc14f7055a9d9ca1aa9219bfa5f4c787598c27f2afdff3c087c"},"properties":{"dependency":{"package":"org.bouncycastle:bcpkix-jdk18on","version":"1.79","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"8979178c2e4f898eb6409d2872c0d5658ac1e9caa652ae0b4ec8d7ab69326c41"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"production","file":"packages/op-vscode/build.mjs","line":1}}}},{"ruleId":"D30","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":"bcdaa4f96dc216cc18343f288e3452695e2810afabbf028b8213158d8365e947"},"properties":{"dependency":{"package":"io.netty:netty-handler-proxy","version":"4.1.110.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ce9462396925ab7c68ffbac3e8a28054c6a56ce11f33578bc54416fdd4010fff"},"properties":{"dependency":{"package":"io.netty:netty-handler-proxy","version":"4.1.93.Final","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"71342b07019701eec98cab8df53e64939fe827a892475f19871f59439fc2cc2e"}},{"ruleId":"D31","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":"de34f45d46ec02fe26e8cb36ce2b316e3c6b38e53730bc832a631595c03a5485"}},{"ruleId":"D31","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":"34ec167d75b9ad8ccdc783c574b75fb82085761df4b2ef0cc4081b8ca363f505"}},{"ruleId":"D31","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":"51607b56b505f4211caa241285c23658f2627f264a1cdbf92621746dcd504177"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: subagent.rs \u2194 variables.rs: \u0060crates/op-orchestrator/src/subagent.rs\u0060 and \u0060crates/op-orchestrator/src/variables.rs\u0060 change together 90% of the time (9 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060169e6abe\u0060 feat(orchestrator): tree-heuristics, palette-harmonize, post-pass ref\u2026; \u00608a39bc7b\u0060 Merge branch \u0027v0.8.0-new\u0027 of github.com:ZSeven-W/openpencil into v0.8\u2026; \u00601a601eca\u0060 feat(orchestrator): design_system \u2014 types \u002B parse \u002B defaults \u002B Progre\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/subagent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43a0237dbd9f6470059ff03715734cd65ebcb0a778a7ed9f0071427a5ef6ce4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: plan_normalize.rs \u2194 variables.rs: \u0060crates/op-orchestrator/src/plan_normalize.rs\u0060 and \u0060crates/op-orchestrator/src/variables.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00608a39bc7b\u0060 Merge branch \u0027v0.8.0-new\u0027 of github.com:ZSeven-W/openpencil into v0.8\u2026; \u00601a601eca\u0060 feat(orchestrator): design_system \u2014 types \u002B parse \u002B defaults \u002B Progre\u2026; \u0060c098effa\u0060 feat(orchestrator): types \u2014 vision validation traits \u002B Progress \u002B config \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_normalize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a1838dc24f8ce1f83f382a12df4ea065c57e77b51b8ad91d78cf3edad6a1f8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: prompt.rs \u2192 plan_normalize.rs, run_tests_b4.rs, variables.rs: \u0060crates/op-orchestrator/src/prompt.rs\u0060 changes together with 3 other files \u2014 \u0060crates/op-orchestrator/src/plan_normalize.rs\u0060, \u0060crates/op-orchestrator/src/run_tests_b4.rs\u0060, \u0060crates/op-orchestrator/src/variables.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/prompt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5096c8154718750e9edcd460768d7411cc7220a7d7f35c1fbce7b520c8336a87"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: click.rs \u2194 press.rs: \u0060crates/op-host-native/src/widget_host/click.rs\u0060 and \u0060crates/op-host-web/src/widget_host/press.rs\u0060 change together 73% of the time (19 of the 26 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 19 shared commits counted here, the most recent 3 are \u00603dc64c1a\u0060 fix(editor): defer transient row actions until release; \u0060d0a7d5e7\u0060 refactor(editor): clear remaining button hover fills; \u006045340f10\u0060 refactor(editor): add shared button press feedback \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/click.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4740106df79052040f7efe1724fda0ded78333a9181fa128f633f3215e522787"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: agent_settings.rs \u2194 settings_io.rs: \u0060crates/op-editor-core/src/agent_settings.rs\u0060 and \u0060crates/op-host-desktop/src/settings_io.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 \u0060194c7d01\u0060 feat(editor): gate preview mode and widget config behind experimental\u2026; \u006026e812db\u0060 fix(settings): track image generation test status; \u0060ec03f06c\u0060 fix(settings): infer ark coding preset by model \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/agent_settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"202be3c71b336c004a02455b11a1c243507aab76898793a72c01238d9ffb1247"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: mcp_serve.rs \u2192 command.rs, command_apply.rs, lib.rs, parser.rs, write_tools.rs: \u0060crates/op-host-desktop/src/mcp_serve.rs\u0060 changes together with 5 other files \u2014 \u0060crates/op-editor-core/src/command.rs\u0060, \u0060crates/op-editor-core/src/command_apply.rs\u0060, \u0060crates/op-mcp/src/lib.rs\u0060, \u0060crates/op-mcp/src/parser.rs\u0060, \u0060crates/op-mcp/src/write_tools.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/mcp_serve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8106f6f43108ecfdae413eb39415841dd506f7e4ea891b39a3f6b43a49335447"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: paint.rs \u2194 paint.rs: \u0060crates/op-host-native/src/widget_host/paint.rs\u0060 and \u0060crates/op-host-web/src/widget_host/paint.rs\u0060 change together 66% of the time (25 of the 38 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 25 shared commits counted here, the most recent 3 are \u0060af15f6cd\u0060 feat(editor): canvas toast banner surfaces the online recovery notice; \u006008f2dc5d\u0060 feat(editor): add delayed top-bar tooltips; \u0060ecebc3e7\u0060 refactor(editor): move the collab join field onto the unified text input \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-native/src/widget_host/paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0c5ed00cfff95acfa064cd698b554a5c04d008ac26c74c3c2145f09c36b90f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: agent_settings_images.rs \u2194 press_helpers.rs: \u0060crates/op-editor-ui/src/widgets/agent_settings_images.rs\u0060 and \u0060crates/op-host-native/src/widget_host/press_helpers.rs\u0060 change together 65% of the time (11 of the 17 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 11 shared commits counted here, the most recent 3 are \u0060a922bd2d\u0060 feat(editor): open the Openverse register link from Settings \u2192 Images; \u006026e812db\u0060 fix(settings): track image generation test status; \u00600c61ba5b\u0060 fix(settings): track image search test status \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/agent_settings_images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a67b18953c20b45fd6b47bb03a41cd2a4246039c33f77e768c647de38ebdab"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: editor_ui_state.rs \u2192 git_panel_ready.rs, property_panel_action.rs, git_host.rs, git_press.rs, overlay_rects.rs: \u0060crates/op-editor-core/src/editor_ui_state.rs\u0060 changes together with 5 other files \u2014 \u0060crates/op-editor-ui/src/widgets/git_panel_ready.rs\u0060, \u0060crates/op-editor-ui/src/widgets/property_panel_action.rs\u0060, \u0060crates/op-host-desktop/src/git_host.rs\u0060, \u0060crates/op-host-native/src/widget_host/git_press.rs\u0060, \u0060crates/op-host-native/src/widget_host/overlay_rects.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/editor_ui_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4bdfd696f6617a49a1b34d75d2141a5dc40e3fee33d989fba834c745ac877f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: tests.rs \u2192 ai_chat_hit.rs, ai_chat_panel_hit.rs, ai_chat_panel_paint.rs: \u0060crates/op-editor-ui/src/widgets/ai_chat_panel/tests.rs\u0060 changes together with 3 other files \u2014 \u0060crates/op-editor-ui/src/widgets/ai_chat_hit.rs\u0060, \u0060crates/op-editor-ui/src/widgets/ai_chat_panel_hit.rs\u0060, \u0060crates/op-editor-ui/src/widgets/ai_chat_panel_paint.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_panel/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d468a9c066e0d3402c46cef5f8c1dd8f26263522a8b0a167eae67b2a7d0d0df7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ai_chat_hit.rs \u2194 press.rs: \u0060crates/op-editor-ui/src/widgets/ai_chat_hit.rs\u0060 and \u0060crates/op-host-web/src/widget_host/press.rs\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060d0a7d5e7\u0060 refactor(editor): clear remaining button hover fills; \u0060b846a292\u0060 fix(ai): apply rust chat design blocks; \u0060b9d5639a\u0060 fix(ai): disable chat input while streaming \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_hit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"987dea1d965deb28f30be171658d9e44d25753bbd1e7b83b2b0bdcabde4a4515"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: chat.rs \u2192 ai_chat_hit.rs, click.rs, press.rs: \u0060crates/op-editor-core/src/chat.rs\u0060 changes together with 3 other files \u2014 \u0060crates/op-editor-ui/src/widgets/ai_chat_hit.rs\u0060, \u0060crates/op-host-native/src/widget_host/click.rs\u0060, \u0060crates/op-host-web/src/widget_host/press.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/chat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaa2f78fed02dfb2e5c576f2761d6dda47087142726e27a9884a382d4dee89b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: property_panel_layout.rs \u2194 property_dispatch.rs: \u0060crates/op-editor-ui/src/widgets/property_panel_layout.rs\u0060 and \u0060crates/op-host-native/src/widget_host/property_dispatch.rs\u0060 change together 55% of the time (12 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00603480abaa\u0060 feat(editor): merge effect adds into one \u0022\u002B\u0022 with a Shadow/Blur menu; \u0060d187eb72\u0060 feat(editor): add a Layer Blur button to the effects section; \u0060e2ca2f03\u0060 feat(panels): per-fill multi-fill Fill editor (stack/add/delete fills) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2351c08cfcc9dcafd52a695db366d893f27f8744a773374a0bb0357fd65a9804"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: run_tests_b4.rs \u2194 subagent.rs: \u0060crates/op-orchestrator/src/run_tests_b4.rs\u0060 and \u0060crates/op-orchestrator/src/subagent.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060096feaf0\u0060 refactor(ai): collapse subagent protocols onto script-gen via the sha\u2026; \u00605b33f8f5\u0060 feat(agent): orchestrator scaffold, subagent, and validation fixes; \u00606fb5ff58\u0060 feat(orchestrator): mobile screen plans, typography cleanup, parse fixes \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/run_tests_b4.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb58f474387a73a5bbaadb5704c9be57fe0c0f76aa77d0fa8d6ac5aba7a3791a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.rs \u2194 command.rs: \u0060crates/op-cli/src/main.rs\u0060 and \u0060crates/op-editor-core/src/command.rs\u0060 change together 52% of the time (12 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060507510ee\u0060 feat(mcp): expose the scene template catalogue to MCP and the CLI; \u0060a26e1b0f\u0060 fix(mcp): support ts move copy targets; \u0060dd34ca85\u0060 fix(mcp): accept ts delete page targets \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb80c3346eb8200cbb5597d29763ee4e9ce1bef07b6c796d359c737810d30d9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.rs \u2194 command_apply.rs: \u0060crates/op-cli/src/main.rs\u0060 and \u0060crates/op-editor-core/src/command_apply.rs\u0060 change together 50% of the time (12 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060507510ee\u0060 feat(mcp): expose the scene template catalogue to MCP and the CLI; \u0060a26e1b0f\u0060 fix(mcp): support ts move copy targets; \u0060dd34ca85\u0060 fix(mcp): accept ts delete page targets \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b5cea5d668fc8ad06d7fc544c98085bf9d34cfef8feae4f0acf663bc2a1ae4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: property_panel_fill.rs \u2194 property_dispatch.rs: \u0060crates/op-editor-ui/src/widgets/property_panel_fill.rs\u0060 and \u0060crates/op-host-native/src/widget_host/property_dispatch.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060cb0842a5\u0060 feat(panels): reorder multiple fill layers; \u0060e2ca2f03\u0060 feat(panels): per-fill multi-fill Fill editor (stack/add/delete fills); \u0060c68aec25\u0060 refactor(editor): migrate fill type picker to shared select \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/property_panel_fill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"629cf4fa8f5318939afde9dfce4d2212deb85f63fbd31505260c7c649d83c0d1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: git_panel_menus.rs \u2194 keyboard.rs: \u0060crates/op-editor-ui/src/widgets/git_panel_menus.rs\u0060 and \u0060crates/op-host-native/src/widget_host/keyboard.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 6 shared commits counted here, the most recent 3 are \u006094f8be68\u0060 refactor(editor): migrate file and git menus to shared menu; \u00607133ab24\u0060 refactor(editor): migrate git auxiliary inputs to shared text state; \u006082d48154\u0060 feat(panels): git-panel commit-detail diff, overflow menu, signature \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/git_panel_menus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d55e4dca4db583a15d68f8fae4dca1c70fb26030f7f9eafbf40b54254c991d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.rs \u2194 chat_runtime.rs: \u0060crates/op-host-desktop/src/main.rs\u0060 and \u0060crates/op-host-services/src/chat_runtime.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are \u0060fe40be77\u0060 refactor(host): move the AI-chat provider cluster to op-web-daemon (P\u2026 (at that commit the file was still \u0060crates/op-web-daemon/src/chat_runtime.rs\u0060); \u00604adfa38b\u0060 feat(ai): chat image attachments \u002B per-provider thinking/effort (at that commit the file was still \u0060crates/op-host-desktop/src/chat_runtime.rs\u0060); \u0060c18ad5a7\u0060 feat: close six TS-parity gaps in the Rust shell (at that commit the file was still \u0060crates/op-host-desktop/src/chat_runtime.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-desktop/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"127c8e8a0b1089e79921c0523362630d7ada5e60410e5cccbcf747f3c11b5c87"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: canvaskit.rs \u2194 vscode_bridge.rs: \u0060crates/op-host-web/src/canvaskit.rs\u0060 and \u0060crates/op-host-web/src/vscode_bridge.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are \u0060cfb2435f\u0060 fix(web): recheck bridge token at fallback completion to close late-i\u2026; \u0060ba9efd43\u0060 fix(web): keep bridge ready reachable on late init and stalled reset; \u006016927aa4\u0060 fix(web): serialize bridge sync-reset before ready \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/canvaskit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1463f927e8bd7e4560cd19d3f4b78076b81df7b20140aced62e079c9fec1d63b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: command.rs \u2194 command_node.rs: \u0060crates/op-editor-core/src/command.rs\u0060 and \u0060crates/op-editor-core/src/command_node.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are \u006089fbee20\u0060 feat(editor-core): mesh/shader fill state \u002B ref id-remap \u002B chat-sessi\u2026; \u00600282283c\u0060 feat(editor): command-layer ops for MCP layered design; \u0060a26e1b0f\u0060 fix(mcp): support ts move copy targets \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbe2cdc77f7ae483584b06d4e18652016d72832730c9d1d2a4a8c707a6c4f58"}},{"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":"5c6b20a1f2ee1ed485c58d171b5b5d026db78f4038bb906ed07c806c88be9bae"}},{"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":"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":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.94: rust-toolchain.toml declares Rust 1.94 as this project\u0027s toolchain file, and Rust 1.94, superseded by 1.95 on 2026-04-16 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-04-16 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":"f69fe0bd737134cbb556df471aeb85ea0f81bdab97b8bad765d34c6fb5724f3c"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_static/index.html"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd605f558186dea69b67b9ba215cbd52b7387664dc4084e8614ace42db9df555"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/smoke/step-1b.html"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"326cc7cac476217267c5f8778ae07a14238c612e2f78349b99cf18a28dd6a3ff"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-web-sdk/smoke/index.html"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b6601682e0d9a97ed149924481627dc9c3cca2fc67e809b56927bc6e9ead48"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.html"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd555aa5b00f4170da64400cf22a97695ffb8341eba68cbb17b408b71b6696b7"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/web_static/missing_bundle.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a56597ca197bf2a6a9314595046f47612706636eba0024fa4315faf9416242"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-web-sdk/smoke/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e77a50cc01dc538410c7aeac47542ff2feda05b71efa927b9a1326ee1e9b69"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"096cf304b5e467c1d809fabfe1169ed832169b0ebe750a0483f72f2e8fef4690"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1508d355ebb85b7e1b1a5640627712b6fedec5882d076ab958cd48546df0d02e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"09745437a3d2a4ee3000ce39e0079f67f76d1e5083c28866c05764c8d21c5216"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 your oxlint config does not list the \u0060jsx-a11y\u0060 plugin (its a11y rules are off until it does) and there\u0027s no axe/pa11y/Lighthouse in tests or CI. Start by enabling that plugin to catch issues at author time. What was searched, so you can tell an absence from a miss: the 5 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 13/24 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/op-cli\u0060, \u0060crates/op-collab-host\u0060, \u0060crates/op-collab-relay-client\u0060, \u0060crates/op-collab-relay-control-plane\u0060 and 6 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (13 clone groups): 13 of the duplicated blocks reported below have copies in at least two of the sibling directories pkg-ck, src under crates/op-host-web/. That concentration is one structural fact, not 13 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 13 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8022638aa4889f58c1edc936969cc486af980feb281f565b1478542bd1927a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:41 \u00B7 crates/op-host-web/src/op_ck_bridge.js:367 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"50916448c82192a33ceb62cc701ed7fa638e9f2738f351d2ad45890becd804c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:202 \u00B7 crates/op-host-web/src/op_ck_bridge.js:838 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58b2e05813f634d2f28757bc4117ca997920c35cec577c520282cf85fe99b7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:340 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1308 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf177eeb5b53e74e501c4b0784a586f916b8f3f64b7809afd8fbd661310c00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/op-chrome-extension/i18n.js:210 \u00B7 packages/op-chrome-extension/i18n.js:255 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/i18n.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ad5f59f8cd72dc4dd18a7d23a2d7f0dd301e6ae4ab6454d5a6582dd0d3c31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_bridge.js:1266 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c3fb91b5195ed0c5c5667ce99cbcab55a434b4605435aed90a218aa9f4efc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/op-chrome-extension/design-capture.js:606 \u00B7 packages/op-chrome-extension/design-evidence.js:233 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f95273ca18ec3e20e2da87dbe7d3c45ed56c7dc0b044a439412b14a9a325044"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): packages/op-vscode/src/vscode/configure-command.ts:52 \u00B7 packages/op-vscode/src/vscode/configure-command.ts:102 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/src/vscode/configure-command.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2786c41d7b52691c8771bb5bacbb0ca55112d486916ef725a77905d24c87fecd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:118 \u00B7 crates/op-host-web/src/op_ck_bridge.js:444 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da3e8972b435f73e0b08ab15038390cb6b923c4d1441c3843551574665c416e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/op-chrome-extension/capture.js:210 \u00B7 packages/op-chrome-extension/picker.js:294 \u2014 the two spans are one implementation copied and then locally edited \u2014 149 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/capture.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ad9cec455e5e1bcfa28967d22d868716709719acc7474608455d714aac76cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/op-chrome-extension/popup.js:187 \u00B7 packages/op-chrome-extension/popup.js:214 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ccb34b259b2a6ef38ebc2ad0a253fce540b261cd9a4e78489ef8d210e24741"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_image_cache.js:142 \u00B7 crates/op-host-web/src/op_ck_image_cache.js:271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aaac9c6aa5ed709cbb8006ddd052d6aecf8689ce7f7e8485ea14da67e2958c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:380 \u00B7 crates/op-host-web/src/op_ck_bridge.js:977 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4073a17e9fdf0212d284fb63085a3fda8c16be44993c4274db60856b88c3e3c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_bridge.js:761 \u00B7 crates/op-host-web/src/op_ck_bridge.js:783 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1f2a62969a25e5b5ed4ed43b87293a08ff7814bae61f2aaf1111a5012d3b05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/op-vscode/src/session/pen-session.ts:412 \u00B7 packages/op-vscode/src/session/pen-session.ts:583 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/src/session/pen-session.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561128abd16ead2726a25dcefdcc5b3dc132115d4ea6a4e14c99e7221fd0a13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:253 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1124 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0e27947b8d8a42dad6cdc0246bba0d32263079c3b7ba2b57ddffb2a47e9b9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_bridge.js:1778 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1791 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fee44a54b275b1cb2e5830362b2f4554e3ea727dd95c2c78f0919e2f6bf92aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/op-web-sdk-react/src/design-view.tsx:25 \u00B7 packages/op-web-sdk-vue/src/design-view.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-web-sdk-react/src/design-view.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cfb607032f8d933a29abc0f73824c038769252054ccbd1c7698760aa16d888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/scripts/sync-version.mjs:258 \u00B7 packages/scripts/sync-version.mjs:281 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/scripts/sync-version.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681a2cdc6293f51e234dde9012c77db89e6526f9d3f7cfb5b80c41b8486e5ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:168 \u00B7 crates/op-host-web/src/op_ck_bridge.js:572 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc27091e93da4ea1bad390330b46e576de56cb3d6643eeccb861ed375df1aaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:241 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1013 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e8fa599d345e5fc7f5cedc0cb4350d735cec362bbd5060b646e6cf4761b5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:431 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1909 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cd6699dafb75584b0dc41e2c990556bd8ea5d7c245c4324751a5a49ab013a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_bridge.js:1517 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"982c74db06b9ad4aa729daa7020d928de73099fd8b0a4a63b716e5a75c6b5c27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/op-chrome-extension/design-capture.js:61 \u00B7 packages/op-chrome-extension/design-evidence.js:28 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42aef6a810d2bcfb13df0aefb61ec7879e6885b4c87acc4b3e107c9ea902be3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/op-web-sdk-react/vitest.config.ts:1 \u00B7 packages/op-web-sdk-vue/vitest.config.ts:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-web-sdk-react/vitest.config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f500a24b6ebc13c12c06f1ec5229be6b8d6c5895e707ad2ea4755d4dc8b0ea90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:9 \u00B7 crates/op-host-web/src/op_ck_bridge.js:9 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f019777c70800952f6dc654f4993769c09322c987609cfdd378bd242fc5120"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/op-html/assets/snapshot-extractor.js:420 \u00B7 crates/op-html/assets/snapshot-extractor.js:765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab368f535a9188d16022686bb85a6ecae204cac042415820135bdda0e6f105e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/op-chrome-extension/client.js:94 \u00B7 packages/op-chrome-extension/client.js:452 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/client.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"682339a2b7f7dd30615b5f654f7df071910564918e55aa8723f5903522677f6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/op-vscode/src/vscode/shell-messages.ts:36 \u00B7 packages/op-vscode/src/vscode/shell-messages.ts:87 \u2014 both copies are in the same file, so extract the block 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":"packages/op-vscode/src/vscode/shell-messages.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f565b215757a7ef25ac9dcf99ca09c1906da8bb1ecf92b5176470ed6046620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:151 \u00B7 crates/op-host-web/src/op_ck_bridge.js:544 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0769b3947ecdd003f218a30b1da1ea591459e8218e1b6a0b8c07ec7f33d409a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/op-html/assets/snapshot-extractor.js:1071 \u00B7 crates/op-html/assets/snapshot-extractor.js:1132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"af55b84adfec0a637f53411e83fd81f9783a190004abf3bd6a50921713a27ffa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/op-chrome-extension/account.js:130 \u00B7 packages/op-chrome-extension/client.js:432 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/account.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d56df7ae64330d603ca1667311e9286f811e9f3f532d37563adb9bb189ad15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/op-chrome-extension/background.js:178 \u00B7 packages/op-chrome-extension/design-md.js:34 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea1c9cf802f3d0b9cbd8d028b08105bb11f7c36e040e61c9aac3c1388c8be3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/op-chrome-extension/capture.js:90 \u00B7 packages/op-chrome-extension/capture.js:193 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/capture.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd8a207db4f959cfa5e21a694a801dd1981d63ab20d5595adc9f7992a7cc2a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:409 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1761 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0311fef4730fe8fcdb259522b9001d2c61206d6ddb837430d9ad66a264e19a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/op-chrome-extension/background.js:223 \u00B7 packages/op-chrome-extension/popup.js:316 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d16019f3e187ade1b6a91ccf1d0ccdbc8647e190b5fc16e6d6316f6faf4a88a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/op-chrome-extension/design-capture.js:402 \u00B7 packages/op-chrome-extension/design-capture.js:413 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a74e5b962637dd4c40455f52e6639db07d5056e960857138e170f0be51925"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:312 \u00B7 crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js:324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"60166e9da3682d88c6d219d912b15fc72deac592b8130ab702d537db083dd0d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_bridge.js:182 \u00B7 crates/op-host-web/src/op_ck_bridge.js:221 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc7c4e1f49fd4c35585180c74dbd9439070944a7f32cbaa4e810be05c533e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/op-host-web/src/op_ck_bridge.js:1557 \u00B7 crates/op-host-web/src/op_ck_bridge.js:1648 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b78cbbad2410a29bc0dd973f9a9ff771a1cd16de9b0b5de316c0b3516423fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDesignEvidenceInPage (cyclomatic 47, cognitive 78): collectDesignEvidenceInPage has cyclomatic complexity 47 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e24a3250c555a7d8a757abe80728b62689f647f1b2fa9af0134ea726f847aa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureParagraph (cyclomatic 39, cognitive 92): measureParagraph has cyclomatic complexity 39 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5051872364f08470f70844469ca4175381956e7ba4bc005d407408b6c38c80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vectorizeSvg (cyclomatic 38, cognitive 49): vectorizeSvg has cyclomatic complexity 38 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a82c7f58fa5064d08189244a258f1c35a8a35cbd0f4926df710c95c27baaee9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawImageWithOptions (cyclomatic 34, cognitive 53): drawImageWithOptions has cyclomatic complexity 34 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0552f4c388780b8960bdfdfae1a6ee04ef4dca6c801456afc4f8fa3673712a87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkRules (cyclomatic 31, cognitive 71): walkRules has cyclomatic complexity 31 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"df27c3f6fbe08438edbac5a335951145ea35d70fc934a8433db723be05e64d9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInboundFromPage (cyclomatic 29, cognitive 25): parseInboundFromPage has cyclomatic complexity 29 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/src/protocol/bridge.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5fed99fb7827db6f2a1bbd74ad41d6ce0579a29b3667c8cdff1c1d83ab36a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateDesignMd (cyclomatic 23, cognitive 30): generateDesignMd has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/client.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884c80378eb6e97f1a5b24f1c79d80647e4876dc116df73041ee6a1e5c42b6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jpegFitsThumbnailBounds (cyclomatic 23, cognitive 26): jpegFitsThumbnailBounds has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5648207dcdf39280891a980173ce6ae394bb8af84f15ad7dff969628ab08d21e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failureMessage (cyclomatic 20, cognitive 6): failureMessage has cyclomatic complexity 20 and cognitive complexity 6; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba23d7a86cd280d3b5bd430ec7187264b6bcd39f49ad8419ca6912c8df119594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toHex (cyclomatic 19, cognitive 24): toHex has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf9282a081ec5092166f890bd5e625a84de794d99c6b2b97329d83ad7eaef86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function componentSample (cyclomatic 19, cognitive 16): componentSample has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0408c0ddb55080f41691e740f2775f6cb7e0bd9aca3e6250525140f9ea65b756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capturePage (cyclomatic 18, cognitive 26): capturePage has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/capture.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49d5e2d28558b81f60efeb2f463706a4bd4aec6e1fcd762a1d740dc7523503b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function t (cyclomatic 17, cognitive 25): t has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/i18n.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad9cb72c4fb78fd9d0be4baeefccf98917b50000b578ec4a48146a00c6604b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function opCkMakeRuntimeShader (cyclomatic 17, cognitive 16): opCkMakeRuntimeShader has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e009c437073fad19fa0b20618861ee4eaff0f7bd8c17efb62be359f3113c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textFirstBaseline (cyclomatic 16, cognitive 20): textFirstBaseline has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e1affdbe85dc4480e04eaae23bdb9f5719fdb4f965cf48317100349e2f047c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildImage (cyclomatic 15, cognitive 21): buildImage has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"0774938dc46c28037252c9327b98be40b45687484b678294e15ebb69c2687e4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildInlineRun (cyclomatic 15, cognitive 21): buildInlineRun has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d371d6a5fb11965ebc90bb897b9388aed716407064dc1b6b1c75c5dd52e8788"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shapeToPathData (cyclomatic 15, cognitive 19): shapeToPathData has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f7d07077111c575a23ea6265fa98aa5f9e7ebc6409f92835db8eb0438a20df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDownload (cyclomatic 15, cognitive 19): onDownload has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"68236b90b15a7c0b878ba4aa1fee9a109307c51129cd0f64449933a52b726ac1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTextLines (cyclomatic 15, cognitive 18): buildTextLines has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a0dc642cfc9200551ab95a47cb78ac1a02b1ef1b1844a83dbf51530bad34a9"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 10 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: crates/op-host-web/src/op_ck_bridge.js (1873), crates/op-html/assets/snapshot-extractor.js (1193), packages/op-chrome-extension/popup.js (697), packages/op-chrome-extension/design-capture.js (628), packages/op-vscode/src/vscode/pen-editor-provider.ts (581), packages/op-vscode/src/session/pen-session.ts (571) (\u002B4 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_bridge.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9bc91a3afc218066fb2475812ceadc589a7d3ddafc8f06df4ae3b4e1372fc0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-html/assets/snapshot-extractor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6b30ace9f6ca4609e5a4da0447e40329257aa61582ff1b9fd3934a2aef5f21"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cccc8d140161bcb7713e85fa73449a2b61b3bea5cd5946973069774de9cc19"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-capture.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a338da8baf1f2586d0b3cda4f99653e7929c20b5cbc6a663007873fbbcb83de7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"959a630edc5e5c627687b7a03e4e4968dd0de1ef94f28a0008702ce0f6b6ad70"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/figma_temp_worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e8b0479ae1afe98bc26e0714ae2d939be3d27ebdee33e6b7b73830f404a174"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/background.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5aea48f08009b835fbc4067b7e28768ecff5ecde4bc2cea90ac6a696a2a9be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/pkg-ck/snippets/op-host-web-c0696e2efbd71421/src/op_ck_bridge.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c1294bfe66044c18117e9777fe40ec804f601631e22417f68b8e229371a244"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1755f22548666e670ef4e26318b37c9d1d844adff23ae2149d34150b79aace"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/picker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ebafad7cb6882b5c2c1073fc632b136a22763eadcfd421f49d6230c91eb48b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/capture.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050716439a988a90ab69dc014287364cd6aae748dc6c9aa34ba5d5d4caff872"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/i18n.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed10387b1a0d5c03b457e8169b6bbd8143e85010d396fa22d1f4705fbc45bab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/account.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"949b1aeb74bb7ecd686df49c46da0b79cdb9bf5d0f0e72535c496faad7ec071f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-evidence.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034a1af7bed53b435a48bc710ab66f400340623b1e7b90d97856d4205cac355"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/scripts/check-locales.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccacf5f0eb0731c91324cd113e6127b08476d8ab2dd9a647901e8b84821a967"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/scripts/check-design-evidence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e6c4ff085e7814d243a71a9ec3f55f491d6188d208c262b6b466125aa94f72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup-status.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a246351dc1456ac677aa8133368ae66676a5b1fbd86cbdf1acca1559d8fc5d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/scripts/generate-iconify-catalog.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6542d8190152fafa54e81498089175b4426f28a9f836723b31a780b0e6940574"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/scripts/check-sw-imports.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a61d51e5109707f68f2c6a332ba09084082eba9ad97de72f0a4247f04a91165"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/core-registry.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d12a96340940cb2a720d1c0e7ade1a77acd4164d176139e7ce828dc9597fba9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/design-md.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f790a53442a9f709958100096d008f1496c3f1f517bfcad3f008a7d086b4bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/wasm-core.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2471436ced6002e4b648ccb91639d9ca14c11e253ae8c277d2a04d23e98f0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-vscode/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c449ff7aedb9b542b0adbe7fc287233f4fbff279e5adf8943d5a953946072c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/op-chrome-extension/popup-worker-actions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f74ba117d2a307d0e794ffddc75f62c44566ea2b571785c3ab2a65176160a3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~404 LoC): no import path from any entry point (19 application, 15 tooling, 35 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/op_ck_image_cache.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2ef98a31448809ae11015b55d6e8d7111e3bb55567b25ce01021198587c919"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (19 application, 15 tooling, 35 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/harmony/entry/hvigorfile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7bbaf1ca166d21d2feab25bfd9751f84c5c24a43867ed169a2e0af0ef65bd0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (19 application, 15 tooling, 35 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/harmony/hvigorfile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b27492078706f09d7c035f1ad50b37bc0b30ebfff6df558e53b22910440a78f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/feather\u0027: Declared in packages/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7202d4488171d3822683e7a38f8d6d90537695e4fe6802882283305032233b13"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/lucide\u0027: Declared in packages/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f1c5e6c653cdbe56fb13cfb119c746e145c2c6b16c1960fe17190ad90b6fe418"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/simple-icons\u0027: Declared in packages/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b0fc4c961e612131df68856ba5729a7dcb8ad481599a4d7b5f395e2f359ddbd"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: No Content-Security-Policy / X-Frame-Options / X-Content-Type-Options configuration found \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060global-nginx.conf\u0060 is committed to this repository and declares the server that serves it, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/collab-relay-edge/global-nginx.conf"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4aff3d2604ee72a9f95e139c68b957b4bd0c788de58dbeea005c3404126e6e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.get(\u0022children\u0022) or doc[\u0022pages\u0022][0][\u0022children\u0022]\u0060 appears character-identically in 2 files \u2014 templates/step0/_generators/qa/cjkcheck.py, templates/step0/_generators/qa/freshcheck.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/step0/_generators/qa/cjkcheck.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe88052d7948103ea8f8124a6df6d2e64876238014bcae237795dace553424c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!call.starts_with(\u0022I(\u0022) || !call.ends_with(\u0027)\u0027)\u0060 appears character-identically in 2 files \u2014 crates/op-mcp/src/batch_design_dsl.rs, crates/op-mcp/src/batch_program_objects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_dsl.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2517b8d5324b937f4964cf84a261e5bc07f5c1cd90372ad44b219bde036e10b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_rail_card_sibling(c) || is_compact_status_badge_structure(c) || c.get(\u0022width\u0022).and_then(Value::as_str) != Some(\u0022fill_container\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-orchestrator/src/geometry_card_rail_fixes.rs, crates/op-orchestrator/src/geometry_diagnostics_collect.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_card_rail_fixes.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9348e42705cd7e73f2c6a4c3ddbb82b7f6f37047b48ceb3e716169ff74c6f86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() != 36 || bytes[8] != b\u0027-\u0027 || bytes[13] != b\u0027-\u0027 || bytes[18] != b\u0027-\u0027 || bytes[23] != b\u0027-\u0027\u0060 appears character-identically in 2 files \u2014 crates/op-auth-bridge/src/collab_claims.rs, crates/op-collab-transport/src/admission.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-auth-bridge/src/collab_claims.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8492d6b9997c74cc7776ae49edd18e0a0e6f214f82403c11948e091c0cac13c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == b\u0027-\u0027 || c == b\u0027\u002B\u0027 || c == b\u0027.\u0027 || c.is_ascii_digit()\u0060 appears character-identically in 3 files \u2014 crates/op-editor-core/src/svg_import/lexer.rs, crates/op-editor-core/src/svg_import/path_data.rs, crates/op-editor-core/src/svg_path_data.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"92387fbb5977f80d75ea5dc5dc0e814333b3ac5000365f80a2c1812547af8407"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code.contains(\u0022\u003Cscript\u0022) || code.contains(\u0022\u003Ctemplate\u0022) || code.contains(\u0022\u003Cstyle\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-codegen/src/ai/parse.rs, crates/op-mcp/src/codegen_plan_store.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-codegen/src/ai/parse.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3333c5b9cf27e8a620022dcbae34a3083931abc7d20aee83f6c9d0f6b9035c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compact.ends_with(\u0022img\u0022) || compact.ends_with(\u0022image\u0022) || compact.ends_with(\u0022photo\u0022) || compact.ends_with(\u0022cover\u0022) || compact.ends_with(\u0022thu\u2026\u0060 appears character-identically in 2 files \u2014 crates/op-chat-agent/src/design_agent_diagnostics.rs, crates/op-image-enrich/src/targets.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/design_agent_diagnostics.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4a37105d1921443ac105620be3db20560057fff0615de7225a1b780a119941"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.builtin_provider_id.is_some() || entry.value.starts_with(\u0022builtin:\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-editor-ui/src/widgets/ai_chat_model_picker.rs, crates/op-editor-ui/src/widgets/ai_chat_panel_footer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/ai_chat_model_picker.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f208e48ca231a2aea3a663a52df57f5b2a7c06e0aebb58bf055e836b2751887"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extension.eq_ignore_ascii_case(\u0022html\u0022) || extension.eq_ignore_ascii_case(\u0022htm\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-host-web/src/dom_io/html_directory_session.rs, crates/op-html/src/project.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7513ac95104c535864657d9df3d42a243fe0615dd2e35f769025ae07e19c1268"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fixed_width(c).is_some() || c.get(\u0022width\u0022).and_then(Value::as_str) == Some(\u0022fit_content\u0022) || c.get(\u0022width\u0022).is_none()\u0060 appears character-identically in 2 files \u2014 crates/op-orchestrator/src/geometry_overflow_fixes.rs, crates/op-orchestrator/src/geometry_row_fixes.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/geometry_overflow_fixes.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe7d362f2c6fb164bde70a9f7c03154cb121200c251d3bf1a2bd8295355260d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_descendant_type(node, \u0022image\u0022) \u0026\u0026 has_text_descendant(node)\u0060 appears character-identically in 2 files \u2014 crates/op-orchestrator/src/orchestration_self_check.rs, crates/op-orchestrator/src/role_post_pass/mobile_cards.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a44cf412c611eac8b22c26f652a930c678719598ea227fdf4c4f53238ec166"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C bytes.len() \u0026\u0026 (bytes[i] == b\u0027-\u0027 || bytes[i] == b\u0027\u002B\u0027)\u0060 appears character-identically in 3 files \u2014 crates/op-editor-core/src/svg_import/lexer.rs, crates/op-editor-core/src/svg_import/path_data.rs, crates/op-editor-core/src/svg_path_data.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-core/src/svg_import/lexer.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"378c90e8559b8cdd66843513311dde7f678b3760a2a10c44f1eaac1d3684e9d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060img.url.starts_with(\u0022__blob:\u0022) || img.url.starts_with(\u0022__hash:\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-figma/src/clipboard.rs, crates/op-figma/src/image_resolver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-figma/src/clipboard.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"be12e040948802e65cb96741979fab92e2881b4f1e117b9dcfdafe3151d2d893"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label.contains(\u0022chip\u0022) || label.contains(\u0022category\u0022) || label.contains(\u0022\u7C7B\u522B\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-orchestrator/src/orchestration_self_check.rs, crates/op-orchestrator/src/role_post_pass/mobile_category_row.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/orchestration_self_check.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8865a7fef330ef02a4eb14545942c3c5af1fc684da2c99654812030406ae285c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022not found\u0022) || lower.contains(\u0022enoent\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-host-services/src/provider_probe.rs, crates/op-host-services/src/provider_probe_copilot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/provider_probe.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"584e3b3844957465a3cda7781b8cf0ad7e9a4e8cebabf5d5df08825fb7fea9ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022timed out\u0022) || lower.contains(\u0022timedout\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-host-services/src/provider_probe.rs, crates/op-host-services/src/provider_probe_copilot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/provider_probe.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc0f8757ec8556fb87c45a24ffb1c7e3abe080326067aac17485f9131328083"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.ends_with(\u0022.op\u0022) || lower.ends_with(\u0022.pen\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-engine-ffi/src/editor_document.rs, crates/op-host-web/src/file_actions/drop_plan.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-engine-ffi/src/editor_document.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f914c6ce9fffa765f10fe03a37a1bf1e8fce9d275f0c20b24e64b81583299b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.starts_with(\u0022http://\u0022) || lower.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-editor-ui/src/widgets/canvas_viewport_image.rs, crates/op-host-desktop/src/render_cli.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_image.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd81c0f91bbdb8c20fbff29309f389915661bad1679b8da66b615658f3d90fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.get(\u0022type\u0022).and_then(Value::as_str) != Some(\u0022frame\u0022) || node.get(\u0022layout\u0022).and_then(Value::as_str) != Some(\u0022horizontal\u0022)\u0060 appears character-identically in 3 files \u2014 crates/op-orchestrator/src/category_grid_density.rs, crates/op-orchestrator/src/role_post_pass/mobile_category_row.rs, crates/op-orchestrator/src/role_post_pass/mobile_search_header.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/category_grid_density.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06da489825b84d7b32ac4eea7751e4f03d9f58db038f965a01e6d86f5abe4ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj.contains_key(\u0022type\u0022) \u0026\u0026 !obj.contains_key(\u0022id\u0022)\u0060 appears character-identically in 3 files \u2014 crates/op-mcp/src/batch_design_normalize.rs, crates/op-mcp/src/batch_layered.rs, crates/op-mcp/src/insert_node_data.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-mcp/src/batch_design_normalize.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda83315c30d7fe4fc5e3c25db3de687f625485b8c09e6fc7275075f38a68044"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.contains(\u0022n1\u0022) \u0026\u0026 raw.contains(\u0022n2\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-editor-host-core/src/codegen_export.rs, crates/op-host-desktop/src/codegen_export.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-host-core/src/codegen_export.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f689d8e7d747da7d0068ef138dd670c9486d1d49894dd6ed8c19417422d5326"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src.starts_with(\u0022data:\u0022) || src.starts_with(\u0022http://\u0022) || src.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-chat-agent/src/chat_canvas_tools.rs, crates/op-host-services/src/export_html_structured/video.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-chat-agent/src/chat_canvas_tools.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f96adbc198ae40be000e8521ca96c17b249444d59a148d36033d69ebd5f81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0027\u003C\u0027) \u0026\u0026 trimmed.contains(\u0022\u003Csvg\u0022)\u0060 appears character-identically in 2 files \u2014 crates/op-editor-ui/src/widgets/canvas_viewport_image/svg_raster.rs, crates/op-host-desktop/src/remote_image_host.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-editor-ui/src/widgets/canvas_viewport_image/svg_raster.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cddd0797352b9f2625fb6bebee33b5ce0916ce0c0f3ccff44f8acecedefb36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.scheme() != \u0022https\u0022 || url.host_str() != Some(\u0022openpencil.local\u0022) || !url.username().is_empty() || url.password().is_some()\u0060 appears character-identically in 2 files \u2014 crates/op-host-web/src/dom_io/html_directory_session.rs, crates/op-html/src/project.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-web/src/dom_io/html_directory_session.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3322b31f01ee0892ca7639805fcc8e7b9b509cafb2946a8dd47fb751f9d895b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.scheme() != \u0022https\u0022 || url.host_str().is_none() || !url.username().is_empty() || url.password().is_some() || url.fragment().is_some() ||\u2026\u0060 appears character-identically in 2 files \u2014 crates/op-host-services/src/profile_avatar_fetch.rs, crates/op-host-services/src/public_https_client.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/profile_avatar_fetch.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"900ca73ab88a8dc0578909c6fdbd9a3bc1d63faaa3db5f0c820bf1f597635b1e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ab-v9/run_matrix.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab07faf641513580719ddaf8272f6485d596fd882c29e38388dcbd24a609376"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ab-v9/run_matrix.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ca71b57eed109d96018e485c2d6f33bbad85625d2dbaf54e8729a32f8d3b2a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060hay.contains(\u0022without bottom navigation\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060hay.contains(\u0022without bottom navigation\u0022)\u0060 also satisfies \u0060hay.contains(\u0022without bottom nav\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_normalize_nav.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8621d880262d5f9421297c0bbd8f1629d81ad572f489db12163791b31e93106e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060hay.contains(\u0022bottom-tab-bar\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060hay.contains(\u0022bottom-tab-bar\u0022)\u0060 also satisfies \u0060hay.contains(\u0022bottom-tab\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/plan_normalize_nav.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d99994dcc72a9f6808288eb0c26dde35b079385604e068fb74afbf2db075dd5"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.contains(\u0022bottom navigation\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.contains(\u0022bottom navigation\u0022)\u0060 also satisfies \u0060name.contains(\u0022bottom nav\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/mobile_content_rail_detect.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aabb47c4255de9727967985a5028f7ca77fdf8dc25e2bbe34ad13dc52152ac"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022navigation\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022navigation\u0022)\u0060 also satisfies \u0060text.contains(\u0022nav\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/dashboard_columns.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b74ae97f606498618515f878afea2843b935aa7d130dc95fec599bb5e5d6a48"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022topheader\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022topheader\u0022)\u0060 also satisfies \u0060text.contains(\u0022header\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/dashboard_columns.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4c7a92d8dd1ff69a7d5aff5381bedfabb584ee0e6a777a9c0a4a02499f0ca8"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060hay.contains(\u0022bottom-navigation\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060hay.contains(\u0022bottom-navigation\u0022)\u0060 also satisfies \u0060hay.contains(\u0022bottom-nav\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_root_and_nav.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"605f837d5fff105dc8e106ef04d2b45680e40b129cfa3b8b5bf3279c4be5d5a2"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060hay.contains(\u0022bottom-navigation\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060hay.contains(\u0022bottom-navigation\u0022)\u0060 also satisfies \u0060hay.contains(\u0022bottom-nav\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/cleanup_root_and_nav.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9182815f0f938157e026a18fbb635c0f5f681c991a290bd1c96ad3c4767b519d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022authenticate first\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022authenticate first\u0022)\u0060 also satisfies \u0060lower.contains(\u0022auth\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/provider_probe_copilot.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8ebd1a9f34cfc06bb546f69eccf6dee6638cbef45ff676562754a567e66850"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022unauthenticated\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022unauthenticated\u0022)\u0060 also satisfies \u0060lower.contains(\u0022auth\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/provider_probe_copilot.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b34519949a76967ce98dfb2e2293c6c8e6b1e437281e4998506084f0c44e799"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060upper.contains(\u0022DESIGN_NEW\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060upper.contains(\u0022DESIGN_NEW\u0022)\u0060 also satisfies \u0060upper.contains(\u0022DESIGN\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-host-services/src/chat_intent.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1696998d43f1d7bfe21c4b51ef5fffb91dcc98d8f498e94a096fca43f86591"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022events.onTap\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022events.onTap\u0022)\u0060 also satisfies \u0060content.contains(\u0022onTap\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/lib_tests.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5797302c13d247468d2f8cc01e535b704367ace933ec7a069fa0c80950317d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060label.contains(\u0022sliders\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060label.contains(\u0022sliders\u0022)\u0060 also satisfies \u0060label.contains(\u0022slider\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/mobile_search_header.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee52bfd48e190385e151a77aa15f7e5c7c979197c02c785712a8aaff2b6fcb1b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060label.contains(\u0022shopping cart\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060label.contains(\u0022shopping cart\u0022)\u0060 also satisfies \u0060label.contains(\u0022cart\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-orchestrator/src/role_post_pass/mobile_cards.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f21be9eb02a5ec9199aa7aeae318698b5a0161e5468c857100a119a7554c341"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060label.contains(\u0022activity graph\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060label.contains(\u0022activity graph\u0022)\u0060 also satisfies \u0060label.contains(\u0022graph\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-design-lint/src/detectors/structure.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9f351684e6b19e71ef56e4e9411378fbb4e74df1a4be056acd9a1116f7aa03"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060l.contains(\u0022card surface\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060l.contains(\u0022card surface\u0022)\u0060 also satisfies \u0060l.contains(\u0022surface\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/parser.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99653247b03b9b033067ff3cfcc9909778cb1007d4ec39ebd227e381ecdafe7"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060l.contains(\u0022default border\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060l.contains(\u0022default border\u0022)\u0060 also satisfies \u0060l.contains(\u0022border\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/parser.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9a2c59c4140b00ed30d95cc973a042891ad24395683ed7f4803e7180c549e3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060l.contains(\u0022primary accent\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060l.contains(\u0022primary accent\u0022)\u0060 also satisfies \u0060l.contains(\u0022accent\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/op-ai-skills/src/style_guide/parser.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c67e5dea2376d3dbd771a98d34e444c9db94af888e4dd4915e813e781b970"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"CWE-248","shortDescription":{"text":"CWE-248"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-290","guid":"379b1e66-a292-7b59-aa1e-a5bb4a6a99e9","name":"CWE-290","shortDescription":{"text":"CWE-290"},"helpUri":"https://cwe.mitre.org/data/definitions/290.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-444","guid":"8989da48-caaf-a955-b9ef-53767db527d8","name":"CWE-444","shortDescription":{"text":"CWE-444"},"helpUri":"https://cwe.mitre.org/data/definitions/444.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"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-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-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"CWE-926","shortDescription":{"text":"CWE-926"},"helpUri":"https://cwe.mitre.org/data/definitions/926.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":104,"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."]}]}